CodeForces 448C - 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 integers a1, a2, ..., an (1 ≤ ai ≤ 109).

Output

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

Examples

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.

/*
题目链接： http://codeforces.com/contest/448/problem/C
 
代码参考：
http://blog.csdn.net/u013076044/article/details/41808899	
这个代码逻辑清楚 
 

题目大意：
给出n个杆子，每个杆子有一个长度，每次可以刷一行或一列，问最少刷多少次可以将整个墙刷成黄色。


就是分治 
	ans = min{ 1.区间长度(全部竖着刷);
			   2.先横着把底部连在一起的全刷了,剩下的在递归调用函数,然后加起来; } 
 
首先，我们假如每次都刷一个木板，即一竖行，那么需要n次刷完，
	可见这是一个ans的最大值。就是最差的情况下我这样刷最多为n刷。
其次：如果我们选择一横行的刷，而n个木板中最短的为min，那么我们可以花min刷，把他们都刷成a[i]-min的高度，	
	那么剩下来的栅栏又变成了开始的情况。 
然后，继续按上面的方法刷，可见是一个递归调用。

*/

#include <iostream>
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <queue>
#include <vector>
#include <cmath>
#include <stack>
#include <string>
#include <sstream>
#include <map>
#include <set>
#define pi acos(-1.0)
#define LL long long
#define ULL unsigned long long
#define inf 0x3f3f3f3f
#define INF 1e18
#define lson l,mid,rt<<1
#define rson mid+1,r,rt<<1|1
#define debug(a) printf("---%d---\n", a)
#define mem0(a) memset(a, 0, sizeof(a))
#define memi(a) memset(a, inf, sizeof(a))
#define mem1(a) memset(a, -1, sizeof(a))
#define input1(a) scanf("%d", &a)
#define input2(a,b) scanf("%d %d", &a, &b)
#define input3(a,b,c) scanf("%d %d %d", &a, &b, &c)
using namespace std;
typedef pair<int, int> P;
const double eps = 1e-10;
const int maxn = 1e6 + 5;
const int N = 1e4 + 5;
const int mod = 1e8;

int h[maxn];  
int n, ans;
int solve(int l, int r) // 区间 [l, r] 
{
	int mi = inf;
	for (int i = l; i <= r; i++)
		mi = min(mi, h[i]);
	for (int i = l; i <= r; i++)
		h[i] -= mi;
	int sum = mi, sta = l;
	for (int i = l; i <= r; i++){
		if (h[i] == 0){
			if (sta == i){ // 如果当前高度就为0 直接跳过 
				sta++;
				continue;
			}
			sum += solve(sta, i-1); // 分治 区间[sta, i-1] 
			sta = i + 1;
		}
	}
	if (h[r] != 0) sum += solve(sta, r); // 最后一个特别讨论 
	return min(sum, r-l+1); // 答案为两者中较小的 
}
int main(void)
{
//	freopen("in.txt","r", stdin); 
	cin >> n;
	int min_ = inf;
	for (int i = 1; i <= n; i++)
		cin >> h[i];  
	cout << solve(1, n) << endl;
	
	return 0;
}