fork download
copy 
  1. // ~~ icebear ~~
  2. #include <bits/stdc++.h>
  3. using namespace std;
  4.  
  5. typedef long long ll;
  6. typedef pair<int, int> ii;
  7. typedef pair<int, ii> iii;
  8.  
  9. template<class T>
  10.     bool minimize(T &a, const T &b) {
  11.         if (a > b) return a = b, true;
  12.         return false;
  13.     }
  14.  
  15. template<class T>
  16.     bool maximize(T &a, const T &b) {
  17.         if (a < b) return a = b, true;
  18.         return false;
  19.     }
  20.  
  21. #define FOR(i,a,b) for(int i=(a); i<=(b); ++i)
  22. #define FORR(i,a,b) for(int i=(a); i>=(b); --i)
  23. #define REP(i, n) for(int i=0; i<(n); ++i)
  24. #define RED(i, n) for(int i=(n)-1; i>=0; --i)
  25. #define MASK(i) (1LL << (i))
  26. #define BIT(S, i) (((S) >> (i)) & 1)
  27. #define mp make_pair
  28. #define pb push_back
  29. #define fi first
  30. #define se second
  31. #define all(x) x.begin(), x.end()
  32. #define task "gen"
  33. /*END OF TEMPLATE. ICEBEAR AND THE CAT WILL WIN VOI26 */
  34.  
  35. const int MOD = 1e9 + 7;
  36. const int inf = 1e9 + 27092008;
  37. const ll INF = 1e18 + 27092008;
  38. const int N = 2e5 + 5;
  39. int n, a[N], par[N][20];
  40. int f[N], L[N], R[N], depth[N], lca[N];
  41.  
  42. int LCA(int u, int v) {
  43.     if (depth[u] < depth[v]) swap(u, v);
  44.     int s = depth[u] - depth[v];
  45.     REP(j, 20) if (BIT(s, j))
  46.         u = par[u][j];
  47.     if (u == v) return u;
  48.     RED(j, 20) if (par[u][j] != par[v][j]) {
  49.         u = par[u][j];
  50.         v = par[v][j];
  51.     }
  52.     return par[u][0];
  53. }
  54.  
  55. void calc(int a[], int L[]) {
  56.     FOR(i, 1, n) f[i] = depth[i] = L[i] = lca[i] = par[i][0] = 0;
  57.     FOR(i, 1, n) {
  58.         int minJ = n + 1, maxJ = 0;
  59.         FOR(j, 1, i - 1) if (a[j] < a[i])
  60.             maximize(f[i], f[j] + 1);
  61.         FOR(j, 1, i - 1) {
  62.             if (f[j] == f[i] - 1 && a[j] < a[i]) {
  63.                 minimize(minJ, j);
  64.                 maximize(maxJ, j);
  65.             }
  66.         }
  67.  
  68.         maximize(f[i], 1);
  69.  
  70.         int p = LCA(minJ, maxJ);
  71. //        cerr << i << ' ' << minJ << ' ' << maxJ << ' ' << p << '\n';
  72.         if (p > 0) L[i] = L[p] + 1;
  73.  
  74.         depth[i] = depth[p] + 1;
  75.         par[i][0] = p;
  76.         FOR(t, 1, 19) par[i][t] = par[par[i][t - 1]][t - 1];
  77.     }
  78. //    cerr << par[3][0] << ' ' << par[4][0] << ' ' << par[5][0] << ' ' << par[7][0] << ' ' << LCA(5, 7) << ' ' << depth[5] << ' ' << depth[7] << '\n';
  79. }
  80.  
  81. void init(void) {
  82.     cin >> n;
  83.     FOR(i, 1, n) cin >> a[i];
  84. }
  85.  
  86. void process(void) {
  87.     calc(a, L);
  88.     reverse(a + 1, a + n + 1);
  89.     FOR(i, 1, n) a[i] = -a[i];
  90.     calc(a, R);
  91.  
  92.     FOR(i, 1, n) cout << L[i] + R[n - i + 1] << ' ';
  93. }
  94.  
  95. int main() {
  96.     ios_base::sync_with_stdio(0);
  97.     cin.tie(0); cout.tie(0);
  98.     if (fopen(task".inp", "r")) {
  99.         freopen(task".inp", "r", stdin);
  100.         freopen(task".out", "w", stdout);
  101.     }
  102.     int tc = 1;
  103. //    cin >> tc;
  104.     while(tc--) {
  105.         init();
  106.         process();
  107.     }
  108.     return 0;
  109. }
  110.  
Success #stdin #stdout 0s 5316KB
comments (?)
stdin
copy 
Standard input is empty
stdout
copy 
Standard output is empty
https://ideone.com/37X8u3
language:
C++14 (gcc 8.3)
created:
3 days ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!