CF 448C Painting Fence

Bizon the Champion isn't just attentive, he also is very hardworking.

Bizon the Champion decided to paint his old fence his favorite color, orange. The fence is represented as n vertical planks, put in a row. Adjacent planks have no gap between them. The planks are numbered from the left to the right starting from one, the i-th plank has the width of 1 meter and the height of a_i meters.

Bizon the Champion bought a brush in the shop, the brush's width is 1 meter. He can make vertical and horizontal strokes with the brush. During a stroke the brush's full surface must touch the fence at all the time (see the samples for the better understanding). What minimum number of strokes should Bizon the Champion do to fully paint the fence? Note that you are allowed to paint the same area of the fence multiple times.

Input

The first line contains integer n (1 ≤ n ≤ 5000) — the number of fence planks. The second line contains n space-separated integersa₁, a₂, ..., a_n (1 ≤ a_i ≤ 10⁹).

Output

Print a single integer — the minimum number of strokes needed to paint the whole fence.

Sample test(s)

input

5
2 2 1 2 1

output

3

input

2
2 2

output

2

input

1
5

output

1

思路：最多需要n个刷子，也就是全都竖刷。看下横刷能否有更优解即可。横刷则将最小高度以下全横刷，然后递归。

#include <iostream>
#include <cstring>
#include <cstdio>
using namespace std;
#define maxn 5080
int x[maxn];
inline int min(int a,int b)
{
	return a>b?b:a;
}

int gao(int l,int r)
{
	int ans = r-l+1;
	int Min = x[l];
	for(int i = l;i <= r;i++)
		Min = min(Min,x[i]);
	for(int i = l;i <= r;i++)
		x[i] -= Min;
	int cost = Min;
	for(int i = l;i <= r;i++)
	{
		if(x[i])
		{
			int j = i;
			while(x[j] && j<=r)	j++;
			cost += gao(i,j-1);
			i = j;
		}
	}
	return min(cost,ans);
}
int main()
{
	int n;
	while(scanf("%d",&n)!=EOF)
	{
		for(int i = 1;i <= n;i++)
			scanf("%d",&x[i]);
		printf("%d\n",gao(1,n));
	}
}