zoukankan      html  css  js  c++  java
  • Codeforces Round #303 (Div. 2)——C DP,贪心—— Woodcutter

    Little Susie listens to fairy tales before bed every day. Today's fairy tale was about wood cutters and the little girl immediately started imagining the choppers cutting wood. She imagined the situation that is described below.

    There are n trees located along the road at points with coordinates x1, x2, ..., xn. Each tree has its height hi. Woodcutters can cut down a tree and fell it to the left or to the right. After that it occupies one of the segments [xi - hi, xi] or [xi;xi + hi]. The tree that is not cut down occupies a single point with coordinate xi. Woodcutters can fell a tree if the segment to be occupied by the fallen tree doesn't contain any occupied point. The woodcutters want to process as many trees as possible, so Susie wonders, what is the maximum number of trees to fell.

    Input

    The first line contains integer n (1 ≤ n ≤ 105) — the number of trees.

    Next n lines contain pairs of integers xi, hi (1 ≤ xi, hi ≤ 109) — the coordinate and the height of the і-th tree.

    The pairs are given in the order of ascending xi. No two trees are located at the point with the same coordinate.

    Output

    Print a single number — the maximum number of trees that you can cut down by the given rules.

    Sample test(s)
    input
    5
    1 2
    2 1
    5 10
    10 9
    19 1
    output
    3
    input
    5
    1 2
    2 1
    5 10
    10 9
    20 1
    output
    4
    Note

    In the first sample you can fell the trees like that:

    • fell the 1-st tree to the left — now it occupies segment [ - 1;1]
    • fell the 2-nd tree to the right — now it occupies segment [2;3]
    • leave the 3-rd tree — it occupies point 5
    • leave the 4-th tree — it occupies point 10
    • fell the 5-th tree to the right — now it occupies segment [19;20]

    In the second sample you can also fell 4-th tree to the right, after that it will occupy segment [10;19].

    大意:定义一个dp[i][j]表示当前是第几棵树想那边倒

    DP做法

    #include<cstdio>
    #include<cstring>
    #include<algorithm>
    using namespace std;
    const int maxn = 100100;
    int x[maxn],h[maxn];
    int dp[10010][3];
    int main()
    {
        int n;
        while(~scanf("%d",&n)){
            for(int i = 1; i <= n ;i++){
                scanf("%d%d",&x[i],&h[i]);
            }
            memset(dp,0,sizeof(dp));
            dp[1][0] = dp[1][1] = 1;
            if(x[2] - x[1] > h[1])
                dp[1][2] = 1;
            long long temp = 0;
            for(int i = 2;i <= n ;i++){
                temp = max(max(dp[i-1][0],dp[i-1][1]),dp[i-1][2]);
                dp[i][1] = temp;
                if(x[i] - h[i] > x[i-1])
                    dp[i][0] = max(dp[i-1][0],dp[i-1][1]) + 1;
                if(x[i] - x[i-1] > h[i] + h[i-1])
                    dp[i][0] = max(dp[i][0],dp[i-1][2]+1) ;
                if(i < n && x[i] + h[i] < x[i+1])
                    dp[i][2] = temp + 1;
                if(i == n)
                    dp[i][2] = temp + 1;
            }
            long long ans = max(max(dp[n][0],dp[n][1]),dp[n][2]);
            printf("%lld
    ",ans);
        }
        return 0;
    }
    
                
    

    贪心做法:

    能向左倒尽量往左倒

    #include<cstdio>
    #include<cstring>
    #include<algorithm>
    using namespace std;
    const int maxn = 100010;
    int x[maxn],h[maxn];
    int main()
    {
        int n;
        while(~scanf("%d",&n)){
            for(int i = 1;  i<= n ;i++)
                scanf("%d%d",&x[i],&h[i]);
            int cout = min(2,n);
            for(int i = 2; i < n; i++){
                if(x[i] - h[i] > x[i-1])
                    cout++;
                else if(x[i]+h[i] < x[i+1]){
                    cout++;
                    x[i] += h[i];
                }
            }
            printf("%d
    ",cout);
        }
        return 0;
    }
            
    

      

     

  • 相关阅读:
    vue播放mu38视频兼容谷歌ie等浏览器
    cube-slide组件的应用
    cube-ui按钮配合toast单例模式应用
    vue网页添加水印
    element ui 下拉框绑定对象并且change传多个参数
    VUE 同一页面路由参数变化,视图不刷新的解决方案
    MySQL Out-of-Band 攻击
    mysql load_file在数据库注入中使用
    Handy Collaborator :用于挖掘out-of-band类漏洞的Burp插件介绍
    基于时间的 SQL注入研究
  • 原文地址:https://www.cnblogs.com/zero-begin/p/4517287.html
Copyright © 2011-2022 走看看