zoukankan      html  css  js  c++  java
  • Codeforces 448 C. 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 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 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 <iostream>
    #include <cstdio>
    #include <cstring>
    #include <algorithm>
    #include <vector>
    
    using namespace std;
    
    const int maxn=5500;
    
    typedef long long int LL;
    typedef pair<int,int> pII;
    
    LL f[maxn],n;
    
    LL solve(int l,int r)
    {
        LL mx=9999999999;
        vector<pII> pi;
        for(int i=l;i<=r;i++)
            mx=min(mx,f[i]);
        bool flag=false;
        int duan[2];
        for(int i=l;i<=r;i++)
        {
            f[i]-=mx;
            if(f[i])
            {
                if(flag==false)
                {
                    flag=true;
                    duan[0]=i;
                }
            }
            else if(f[i]==0)
            {
                if(flag==true)
                {
                    flag=false;
                    duan[1]=i-1;
                    pi.push_back((make_pair(duan[0],duan[1])));
                }
            }
        }
        if(flag==true)
        {
            flag=false;
            duan[1]=r;
            pi.push_back((make_pair(duan[0],duan[1])));
        }
        LL digui=0;
        int sz=pi.size();
        for(int i=0;i<sz;i++)
        {
            digui+=solve(pi[i].first,pi[i].second);;
        }
        return min((LL)(r-l+1),digui+mx);
    }
    
    int main()
    {
        cin>>n;
        for(int i=1;i<=n;i++) cin>>f[i];
        cout<<solve(1,n)<<endl;
        return 0;
    }
    




  • 相关阅读:
    Python 字符串(一)
    UVA 11552 四 Fewest Flops
    UVA 10534 三 Wavio Sequence
    UVA 1424 二 Salesmen
    UVA 11584 一 Partitioning by Palindromes
    CodeForces 549G Happy Line
    CodeForces 451C Predict Outcome of the Game
    CodeForces 567C Geometric Progression
    CodeForces 527B Error Correct System
    CodeForces 552C Vanya and Scales
  • 原文地址:https://www.cnblogs.com/lxjshuju/p/6786415.html
Copyright © 2011-2022 走看看