1 solutions
-
0
#include<bits/stdc++.h> using namespace std; int n,l[200010],r[200010],a[200010],res; int main() { cin>>n; for(int i=1;i<=n;i++) { cin>>a[i]; } for(int i=1;i<=n;i++) { l[i]=min(l[i-1]+1,a[i]); } for(int i=n;i>=1;i--) { r[i]=min(r[i+1]+1,a[i]); } for(int i=1;i<=n;i++) { res=max(res,min(l[i],r[i])); } cout<<res; return 0; }
Information
- ID
- 2473
- Time
- 1000ms
- Memory
- 256MiB
- Difficulty
- 3
- Tags
- (None)
- # Submissions
- 2
- Accepted
- 2
- Uploaded By