zoukankan      html  css  js  c++  java
  • Apple Catching(POJ 2385)

    Apple Catching
    Time Limit: 1000MS   Memory Limit: 65536K
    Total Submissions: 9978   Accepted: 4839

    Description

    It is a little known fact that cows love apples. Farmer John has two apple trees (which are conveniently numbered 1 and 2) in his field, each full of apples. Bessie cannot reach the apples when they are on the tree, so she must wait for them to fall. However, she must catch them in the air since the apples bruise when they hit the ground (and no one wants to eat bruised apples). Bessie is a quick eater, so an apple she does catch is eaten in just a few seconds.

    Each minute, one of the two apple trees drops an apple. Bessie, having much practice, can catch an apple if she is standing under a tree from which one falls. While Bessie can walk between the two trees quickly (in much less than a minute), she can stand under only one tree at any time. Moreover, cows do not get a lot of exercise, so she is not willing to walk back and forth between the trees endlessly (and thus misses some apples).

    Apples fall (one each minute) for T (1 <= T <= 1,000) minutes. Bessie is willing to walk back and forth at most W (1 <= W <= 30) times. Given which tree will drop an apple each minute, determine the maximum number of apples which Bessie can catch. Bessie starts at tree 1.

    Input

    * Line 1: Two space separated integers: T and W

    * Lines 2..T+1: 1 or 2: the tree that will drop an apple each minute.

    Output

    * Line 1: The maximum number of apples Bessie can catch without walking more than W times.

    Sample Input

    7 2
    2
    1
    1
    2
    2
    1
    1

    Sample Output

    6

    Hint

    INPUT DETAILS:

    Seven apples fall - one from tree 2, then two in a row from tree 1, then two in a row from tree 2, then two in a row from tree 1. Bessie is willing to walk from one tree to the other twice.

    OUTPUT DETAILS:

    Bessie can catch six apples by staying under tree 1 until the first two have dropped, then moving to tree 2 for the next two, then returning back to tree 1 for the final two.
     1 #include <iostream>
     2 #include <cstdio>
     3 #include <cstring>
     4 #include <algorithm>
     5 using namespace std;
     6 int main()
     7 {
     8     int i,j,t,n,Max=0;
     9     int dp[1000+10][35];
    10     int a[1000+10];
    11     freopen("in.txt","r",stdin);
    12     scanf("%d%d",&t,&n);
    13     for(i=1;i<=t;i++)
    14         scanf("%d",&a[i]);
    15     for(i=1;i<=t;i++)
    16     {
    17         dp[i][0]=dp[i-1][0]+2-a[i];            //dp[i][j]={第i分钟走了j步所摘到的苹果}
    18         for(j=1;j<=n;j++)
    19         {
    20             if(j%2)                                //如果为奇数,说明走到了2树
    21                 dp[i][j]=max(dp[i-1][j],dp[i-1][j-1])+a[i]-1;    //取前一分钟的最大值
    22             else                                    
    23                 dp[i][j]=max(dp[i-1][j],dp[i-1][j-1])+2-a[i];
    24         }
    25     }
    26     for(i=0;i<=n;i++)
    27         Max=max(dp[t][i],Max);
    28     printf("%d
    ",Max);
    29 
    30 }
  • 相关阅读:
    2.vue插件总结——总有你能用上的插件
    1.前端数据可视化插件:Highcharts、Echarts和D3(区别)
    git学习地址
    node vue 微信公众号(四)配置环境 本地测试
    解决element 分页组件,搜索过后current-page 绑定的数据变了,但是页面当前页码并没有变的问题
    导入excel并进行数据提取
    后端返回字符串中带换行符,前端需转换
    正则表达式tab表示
    FormData
    interval
  • 原文地址:https://www.cnblogs.com/a1225234/p/5171090.html
Copyright © 2011-2022 走看看