zoukankan      html  css  js  c++  java
  • Codeforces 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 integers a1, a2, ..., an (1 ≤ ai ≤ 109).

    Output

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

    分治法做,注意判断当前是否能直接全用竖直方向的解决

    #include <cstdio>
    #include <cmath>
    #include <cctype>
    #include <iostream>
    #include <cstring>
    #include <algorithm>
    #include <string>
    #include <stack>
    #include <vector>
    #include <map>
    #include <set>
    using namespace std;
    typedef long long LL;
    
    LL res = 0,n;
    LL a[5005];
    LL divide_conquer(LL l,LL r){
      int mini = l;
      // for (int i=1;i<=5;i++){
      //   cout << a[i] << " ";
      // }cout << l << " " << r << " " << res << endl;
      if (l > r) return 0;
      if (l == r){
        if (a[l] != 0) {
          a[l] = 0;
          return 1;
        }
        return 0;
      }
      for (int i=l+1;i<=r;i++){
        if (a[i] <= a[mini]){
          mini = i;
        }
      }
      if (a[mini] >= r - l + 1 ){
        for (int i=l;i<=r;i++){
          a[i] = 0;
        }
        return (r - l + 1);
      }
      LL temp = a[mini];
      for (int i=l;i<=r;i++){
        a[i] -= temp;
      }
      return min((divide_conquer(l,mini-1) + divide_conquer(mini+1,r) + temp),r-l+1);
    }
    int main() {
      // freopen("test.in","r",stdin);
      ios::sync_with_stdio(false);
      cin >> n;
      for (int i=1;i<=n;i++){
        cin >> a[i];
      }
    
      cout << divide_conquer(1,n);;
      return 0;
    }
    View Code
  • 相关阅读:
    IPFS实践之初体验
    自己写的屏幕录像及播放软件
    绿色ip扫描工具
    ASIHTTPRequest 编码问题
    ios开发中,A valid provisioning profile for this executable was not found,的解决方法
    毕业设计之蚁群算法的研究——起始篇
    分享两个模拟get和post方法的工具类,让应用能够与服务器进行数据交互
    安卓中生成二维码和扫描二维码
    分享一个安卓中异步获取网络图片并自适应大小的第三方程序(来自github)
    不只是个程序员
  • 原文地址:https://www.cnblogs.com/ToTOrz/p/7274752.html
Copyright © 2011-2022 走看看