Codeforces Round #256 (Div. 2) C. Painting Fence

C. Painting Fence

time limit per test

1 second

memory limit per test

512 megabytes

input

standard input

output

standard output

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 ai 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 integersa1, a2, ..., an (1 ≤ ai ≤ 109).

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

Note

In the first sample you need to paint the fence in three strokes with the brush: the first stroke goes on height 1 horizontally along all the planks. The second stroke goes on height 2 horizontally and paints the first and second planks and the third stroke (it can be horizontal and vertical) finishes painting the fourth plank.

In the second sample you can paint the fence with two strokes, either two horizontal or two vertical strokes.

In the third sample there is only one plank that can be painted using a single vertical stroke.

题意：我是一个粉刷匠，咿呀咿呀哟。有n块宽度都为1，高度各不相同的栅栏围城一行，粉刷匠有个宽度为1的刷子，他可以横着刷，竖着刷，不可以斜着刷哟。当然刷到尽头就停止。问最少刷多少次能刷满，可以重叠刷。

题解:刚开始本来想用着DP的，后来试了N久还是wrong了。弃疗。后来在网上发现一个新的思路。无脑切切切。先切腿切齐之后分块继续往上切。分区操作。就可以了。

#include <bits/stdc++.h>
using namespace std;
int a[5010];
int n;
int gogogo(int l,int r)
{
	int len=r-l+1;
	int max=a[l],ans=0;
	for (int i=l;i<=r;i++)
		if (a[i]<max)
			max=a[i];
	for (int i=l;i<=r;i++)
		a[i]-=max;
	ans=max;
	for (int i=l;i<=r;i++)
	{
		if (a[i]!=0)
		{
			int l1=i,r1=i+1;
			while (a[r1]!=0 && r1<=r)
				r1++;
			r1--;
			ans+=gogogo(l1,r1);
		}
	}
	if (len<ans)
		ans=len;
	return ans;
}
int main()
{
	scanf("%d",&n);
	for (int i=1;i<=n;i++)
		scanf("%d",&a[i]);
	cout<<gogogo(1,n)<<endl;
	return 0;
}