-
Notifications
You must be signed in to change notification settings - Fork 3
/
Copy path262144.cpp
50 lines (44 loc) · 1.42 KB
/
262144.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pii;
template <typename T1, typename T2>
ostream &operator <<(ostream &os, pair<T1, T2> p){os << p.first << " " << p.second; return os;}
template <typename T>
ostream &operator <<(ostream &os, vector<T> &v){for(T i : v)os << i << ", "; return os;}
template <typename T>
ostream &operator <<(ostream &os, set<T> s){for(T i : s) os << i << ", "; return os;}
template <typename T1, typename T2>
ostream &operator <<(ostream &os, map<T1, T2> m){for(pair<T1, T2> i : m) os << i << endl; return os;}
int dp[262144][60];
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
freopen("262144.in", "r", stdin);
freopen("262144.out", "w", stdout);
int N; cin >> N;
int a[N];
for(int i = 0; i < N; i++) cin >> a[i];
fill(dp[0], dp[N-1]+60, -1);
for(int i = 0; i < N; i++){
dp[i][a[i]] = i;
}
int ans = 0;
for(int k = 0; k < 60; k++){
for(int i = 0; i < N; i++){
if(a[i] >= k){
continue;
}
int sec1 = dp[i][k-1];
//cout << "I: " << i << " K: " << k << " " << sec1 << endl;
if(sec1 == -1 || sec1 == N-1) continue;
int sec2 = dp[sec1+1][k-1];
if(sec2 == -1) continue;
dp[i][k] = sec2;
ans = k;
}
}
cout << ans << endl;
return 0;
}