Codeforces Round #256 (Div. 2)-C. Painting Fence
2017-01-30 10:11
323 查看
原题链接
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
output
input
output
input
output
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.
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.
#include <bits/stdc++.h> #define maxn 5005 #define INF 1e18 #define MOD 1000000007 typedef long long ll; using namespace std; int num[maxn]; int dfs(int l, int r, int pre){ if(r < l) return 0; int h = min_element(num+l, num+r+1) - num; return min(r-l+1, dfs(l, h-1, num[h]) + dfs(h+1, r, num[h]) + num[h] - pre); } int main(){ // freopen("in.txt", "r", stdin); int n; scanf("%d", &n); for(int i = 1; i <= n; i++) scanf("%d", num+i); printf("%d\n", dfs(1, n, 0)); return 0; }
相关文章推荐
- 前端分页功能的实现以及原理
- json数据操作
- React&Redux
- 276. Paint Fence
- Effective Java 读书笔记——39:必要时进行保护性拷贝
- jsp表单中上传文件 enctype="multipart/form-data"解释
- jquery defered 对象学习
- Effective Java 读书笔记——15:使可变性最小化
- JavaScript 雷达
- [转] 钉钉的H5性能优化方案
- Bootstrap表单构造器
- 『状态』驱动的世界:ReactiveCocoa
- jstl核心标签库和其他
- jsp_el内置对象pageContext和Cookie
- 3145: [Feyat cup 1.5]Str
- jquery tooltip插件
- JavaScript document.write 与 document.writeln 的区别
- bootstrap-table相关参数的解释
- JavaScript cookie()的使用
- 12 Iterationg Over Data With JSX