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 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.

     这是博主接触分治的第一题，听了学长的讲解之后对分治有了些基本的概念。
这题是典型的分治模板题，将大问题分成一个个的小问题求解。另外，这题博主在自己AC后又参照了codeforces上的优秀代码，姿势真的是优美呢。

#include<cstdio>
#include<iostream>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<stack>
#include<queue>
#include<vector>
using namespace std;
int n,a[5050];
int fenzhi(int l,int r,int base){ //base为本区块篱笆的底
    if(l>r) return 0;
    int m=min_element(a+l,a+r+1)-a; //找出最短的篱笆位置
    return min(r-l+1,fenzhi(l,m-1,a[m])+fenzhi(m+1,r,a[m])+a[m]-base); //min(本区块横刷最低块费用，竖刷费用)
}
/*博主刚开始一直在纠结如何分块，后来看到别人的代码意识到其实分多块和分两块是没有区别的，如果某一区块有多个最短篱笆是分两块只会
让你在其中一块得到一个a[m]-base=0的最短篱笆*/ 
int main()
{
    scanf("%d",&n);
    for(int i=1;i<=n;i++)
        scanf("%d",&a[i]);
    cout<<fenzhi(1,n,0)<<endl;
    return 0;
}