题目:
思路:对一个塔而言,最多消h次就可以消完,h为它的高度。如果它的左边或右边被消完的话,那他也可以在下一步被消完。先看左边,假设这是第i个塔,那从左边开始消的话,最少可以用f[i]=min(h,i,f[i-1]+1)步消完,从右边消的话,最好可以用f[i]=min(h,n-i+1,f[i+1]+1),两个f[i]取最小值就得到了这个塔被消完的最少步数,然后所有f[i]求最大值就得到了把这个图消完的最少步数。
代码:
#include <cstdlib>
#include <cctype>
#include <cstring>
#include <cstdio>
#include <cmath>
#include<climits>
#include <algorithm>
#include <vector>
#include <string>
#include <iostream>
#include <sstream>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <fstream>
#include <numeric>
#include <iomanip>
#include <bitset>
#include <list>
#include <stdexcept>
#include <functional>
#include <utility>
#include <ctime>
using namespace std;
#define PB push_back
#define MP make_pair
#define REP(i,x,n) for(int i=x;i<(n);++i)
#define FOR(i,l,h) for(int i=(l);i<=(h);++i)
#define FORD(i,h,l) for(int i=(h);i>=(l);--i)
#define SZ(X) ((int)(X).size())
#define ALL(X) (X).begin(), (X).end()
#define RI(X) scanf("%d", &(X))
#define RII(X, Y) scanf("%d%d", &(X), &(Y))
#define RIII(X, Y, Z) scanf("%d%d%d", &(X), &(Y), &(Z))
#define DRI(X) int (X); scanf("%d", &X)
#define DRII(X, Y) int X, Y; scanf("%d%d", &X, &Y)
#define DRIII(X, Y, Z) int X, Y, Z; scanf("%d%d%d", &X, &Y, &Z)
#define OI(X) printf("%d",X);
#define RS(X) scanf("%s", (X))
#define MS0(X) memset((X), 0, sizeof((X)))
#define MS1(X) memset((X), -1, sizeof((X)))
#define LEN(X) strlen(X)
#define F first
#define S second
#define Swap(a, b) (a ^= b, b ^= a, a ^= b)
#define Dpoint strcut node{int x,y}
#define cmpd int cmp(const int &a,const int &b){return a>b;}
/*#ifdef HOME
freopen("in.txt","r",stdin);
#endif*/
const int MOD = 1e9+7;
typedef vector<int> VI;
typedef vector<string> VS;
typedef vector<double> VD;
typedef long long LL;
typedef pair<int,int> PII;
//#define HOME
int Scan()
{
int res = 0, ch, flag = 0;
if((ch = getchar()) == '-') //判断正负
flag = 1;
else if(ch >= '0' && ch <= '9') //得到完整的数
res = ch - '0';
while((ch = getchar()) >= '0' && ch <= '9' )
res = res * 10 + ch - '0';
return flag ? -res : res;
}
/*----------------PLEASE-----DO-----NOT-----HACK-----ME--------------------*/
int h[100000+5];
int ans[100000+5];
int main()
{int n;
RI(n);
for(int i=1;i<=n;i++)
RI(h[i]);
ans[0]=ans[n+1]=0;
for(int i=1;i<=n;i++)
{
ans[i]=min(h[i],i);
ans[i]=min(ans[i-1]+1,ans[i]);
}
for(int i=n;i>=1;i--)
{
ans[i]=min(ans[i],n-i+1);
ans[i]=min(ans[i+1]+1,ans[i]);
}
int res=0;
for(int i=1;i<=n;i++)
res=max(res,ans[i]);
printf("%d\n",res);
return 0;
}