Codeforce - 573B - Bear and Blocks

最新推荐文章于 2019-05-30 15:19:49 发布

佐敦不下雨

最新推荐文章于 2019-05-30 15:19:49 发布

阅读量280

点赞数

分类专栏：成长

本文链接：https://blog.csdn.net/qq_36551426/article/details/57401476

版权

成长专栏收录该内容

48 篇文章 2 订阅

订阅专栏

B. Bear and Blocks
time limit per test1 second
memory limit per test256 megabytes
inputstandard input
outputstandard output
Limak is a little bear who loves to play. Today he is playing by destroying block towers. He built n towers in a row. The i-th tower is made of hi identical blocks. For clarification see picture for the first sample.

Limak will repeat the following operation till everything is destroyed.

Block is called internal if it has all four neighbors, i.e. it has each side (top, left, down and right) adjacent to other block or to the floor. Otherwise, block is boundary. In one operation Limak destroys all boundary blocks. His paws are very fast and he destroys all those blocks at the same time.

Limak is ready to start. You task is to count how many operations will it take him to destroy all towers.

Input
The first line contains single integer n (1 ≤ n ≤ 105).

The second line contains n space-separated integers h1, h2, …, hn (1 ≤ hi ≤ 109) — sizes of towers.

Output
Print the number of operations needed to destroy all towers.

Examples
input
6
2 1 4 6 2 2
output
3
input
7
3 3 3 1 3 3 3
output
2
Note
The picture below shows all three operations for the first sample test. Each time boundary blocks are marked with red color.

这里写图片描述
After first operation there are four blocks left and only one remains after second operation. This last block is destroyed in third operation.

题意：有一面墙，小熊每次把与空气接触的砖块锤掉，求要锤的次数的最大值。

思路：每一列墙所需的次数，与其高度、前后墙的高度、位置有关，即当前次数可能是当前墙的高度，也可能是前一道墙的次数 +1 。或当前次数可能是当前墙的高度，也可能是后一道墙的次数 +1 。
所以可以从左右两个方向dp，把次数记录下来，取其小值。

AC代码：

#include <bits/stdc++.h>
#include <iostream>
#include <cstring>
using namespace std;

int main()
{
    int n;cin>>n;
    int a[n+5];
    memset (a,0,sizeof (a));
    for (int i=1;i<=n;i++) cin>>a[i];

    int L[n+5],R[n+5],ans=0;
    memset (L,0,sizeof (L));
    memset (R,0,sizeof (R));
    for (int i=1;i<=n;i++) L[i]=min(a[i],L[i-1]+1);//当前高度与前一个的次数取小*/
    for (int i=n;i;i--) R[i]=min(a[i],R[i+1]+1);/*当前墙的高度与后一道墙的次数取小*/
    for (int i=1;i<=n;i++) ans=max(ans,min(R[i],L[i]));
    cout<<ans;
}