Codeforces 448C Painting Fence

原创 2015年11月21日 16:43:59

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.

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.

解题思路:对于某一个区间分两种策略去进行操作,第一种操作为每个栅栏单独刷,这样最终的结果为r-l+1。第二种策略为用这个区间内的最小的高度横着刷一次,然后对各个子区间分别采用这两种方式进行最优值的求解,最终得到整个大区间的最优值。采用分治的方法进行求解。

#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <numeric>
#include <algorithm>
#include <functional>
using namespace std;
const int maxn = 5010;
int h[maxn];

int dfs(int l, int r) {
    if(l == r) return 1;
    int t1 = r - l + 1;
    int t2 = 0;
    int minh = 0x3f3f3f3f;
    for(int i = l; i <= r; ++i) {
        minh = min(minh, h[i]);
    }
    t2 += minh;
    int s = -1, e = -1;
    for(int i = l; i <= r; ++i) {
        h[i] -= minh;
        if(h[i] > 0) {
            if(s == -1) {
                s = i;
                e = i;
            } else {
                e = i;
            }
        } else {
            if(s > 0) {
                t2 += dfs(s, e);
            }
            s = -1;
            e = -1;
        }
    }
    if(s > 0) t2 += dfs(s, e);
    return min(t1, t2);
}

int main() {

    //freopen("aa.in", "r", stdin);

    int n;
    scanf("%d", &n);
    for(int i = 1; i <= n; ++i) {
        scanf("%d", &h[i]);
    }
    printf("%d\n", dfs(1, n));
    return 0;
}

codeforces 448CPainting Fence

题目:codeforces 448CPainting Fence 题意:n个1* a [ i ] 的木板,把他们立起来,变成每个木板宽为1长为 a [ i ] 的栅栏,现在要给栅栏刷漆,刷子...
  • y990041769
  • y990041769
  • 2014年07月18日 18:23
  • 1518

codeforces 448C C. Painting Fence(分治+dp)

题目链接:codeforces 448C题目大意:给出n个杆子,每个杆子有一个长度,每次可以刷一行或一列,问最少刷多少次可以将整个墙刷成黄色。题目分析: 首先我们能够想到,如果横着刷,为了得到最优解,...
  • qq_24451605
  • qq_24451605
  • 2015年09月16日 13:19
  • 1170

codeforces 448C Painting Fence

刷篱笆,只有横和竖, 竖着肯定最多是 n , 另一种 那么每一次先把最下面的那个刷掉,  刷掉之后 ,  继续把上面的  刷掉,, 每一次把  剩下的   再按横着或竖着  刷    就是分治了 ...
  • u013076044
  • u013076044
  • 2014年12月08日 20:59
  • 816

codeforces 448C Painting Fence

C. Painting Fence time limit per test 1 second memory limit per test 512 megabytes input stand...
  • Donald_TY
  • Donald_TY
  • 2016年03月01日 20:27
  • 286

CodeForces-448C Painting Fence

#include #include #include #include #include using namespace std; vector fence; int n; int d...
  • somniloquy_
  • somniloquy_
  • 2015年08月16日 20:39
  • 286

Codeforces Round #256 (Div. 2) C. Painting Fence(分治+贪心)(好题)

http://codeforces.com/contest/448/problem/C C. Painting Fence time limit per test 1...
  • kalilili
  • kalilili
  • 2015年06月30日 15:31
  • 558

Painting Fence - #256 (Div. 2) C (448C) dp

Painting Fence time limit per test 1 second memory limit per test 512 megabytes inp...
  • u014733623
  • u014733623
  • 2014年07月18日 13:16
  • 1200

CodeForces 448C - Painting Fence(分治)

C. Painting Fence time limit per test 1 second memory limit per test 512 megabytes ...
  • Waves___
  • Waves___
  • 2017年01月18日 22:23
  • 146

codeforces 448C Painting Fence(分治)

Bizon the Champion isn’t just attentive, he also is very hardworking.Bizon the Champion decided to p...
  • elbadaernu
  • elbadaernu
  • 2017年08月03日 00:56
  • 119

CF 448C Painting Fence

分治。最大值为n个篱笆都竖着涂。
  • u011439362
  • u011439362
  • 2014年08月01日 10:23
  • 383
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:Codeforces 448C Painting Fence
举报原因:
原因补充:

(最多只允许输入30个字)