zoukankan      html  css  js  c++  java
  • poj 2385

    Apple Catching
    Time Limit: 1000MS   Memory Limit: 65536K
    Total Submissions: 9856   Accepted: 4786

    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.

    Source

     
     
    设dp[i][j]为经过i时间并且来回j次所能得到的最大苹果数,c为在此刻在此苹果树下是否能接到苹果。
      dp[i][j] = max(dp[i - 1][j - 1], dp[j]) + c;
     
     
     1 #include <cstdio>
     2 #include <cstring>
     3 #include <algorithm>
     4 #include <iostream>
     5 
     6 using namespace std;
     7 
     8 int dp[1005][40];
     9 int T, W;
    10 int a[1005];
    11 
    12 int main() {
    13 
    14     scanf("%d%d", &T, &W);
    15     memset(dp, -1, sizeof(dp));
    16     dp[0][0] = 0;
    17     for (int i = 0; i < T; ++i) {
    18         scanf("%d", &a[i]);
    19     }
    20 
    21     for (int i = 1; i <= T; ++i) {
    22         for (int j = 0; j <= W; ++j) {
    23             int c = (0 + j) % 2 == a[i - 1] - 1 ? 1 : 0;
    24             dp[i][j] = max(dp[i][j], dp[i - 1][j] + c);
    25             if (j != 0) {
    26                 dp[i][j] = max(dp[i][j], dp[i - 1][j - 1] + c);
    27             }
    28 
    29         }
    30     }
    31 
    32     int ans = 0;
    33     for (int i = 0; i <= W; ++i) {
    34         ans = max(ans, dp[T][i]);
    35     }
    36 
    37     printf("%d
    ", ans);
    38 
    39 
    40 
    41     return 0;
    42 }
    View Code
  • 相关阅读:
    《metasploit渗透测试魔鬼训练营》靶机演练之第五章实战案例KingView 6.53版本CVE-2011-0406漏洞
    《metasploit渗透测试魔鬼训练营》学习笔记第五章--网络服务渗透攻击
    《metasploit渗透测试魔鬼训练营》靶机演练之第五章实战案例Oracle数据库
    《metasploit渗透测试魔鬼训练营》学习笔记第四章—web应用渗透
    《metasploit渗透测试魔鬼训练营》学习笔记第三章----情报搜集
    Kali-linux Arpspoof工具
    Kali-linux攻击路由器
    Kali-linux在树莓派上破解无线网络
    Kali-linux使用Easy-Creds工具攻击无线网络
    20155225 2016-2017-2 《Java程序设计》第五周学习总结
  • 原文地址:https://www.cnblogs.com/hyxsolitude/p/5103244.html
Copyright © 2011-2022 走看看