队友很随意的撸出来的,而且好像比题解的容易理解,鉴于队友不喜欢写博客,我帮他写下记录下,其实
是我自己不会学习一下,感觉队友比我聪明,灵感比较多,他好像是直接计算出每一堆消去的最少次数,但是需要正反扫一次,
然后找出全部的最大值即可,
#include<algorithm>
#include<iostream>
#include<limits.h>
#include<stdlib.h>
#include<string.h>
#include<complex>
#include<cstring>
#include<iomanip>
#include<stdio.h>
#include<bitset>
#include<cctype>
#include<math.h>
#include<string>
#include<time.h>
#include<vector>
#include<cmath>
#include<queue>
#include<stack>
#include<list>
#include<map>
#include<set>
#define LL long long
#define ULL unsigned long long
using namespace std;
const LL mod = 1000000007;
const double PI = acos(-1.0);
const double E = exp(1.0);
const int M = 1e5 + 5;
int a[M];
int main()
{
int n;
cin >> n;
int mx = 0;
for(int i = 1; i <= n; ++i)
scanf("%d", &a[i]);
for(int i = 1; i <= n; ++i){
int temp = min(i, min(a[i], min(a[i - 1], a[i + 1]) + 1));
a[i] = temp;
}
for(int i = n; i > 0; --i){
int temp = min(n - i + 1, min(a[i], min(a[i - 1], a[i + 1]) + 1));
a[i] = temp;
}
for(int i = 1; i <= n; ++i)
mx = max(mx, a[i]);
cout << mx << endl;
return 0;
}