POJ2385 Apple Catching

POJ2385 Apple Catching

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

1
2
3
4
5
6
7
8
7 2
2
1
1
2
2
1
1

Sample Output

1
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.

Answer

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
#include <cstdio>
#include <algorithm>
using namespace std;

int a[1010], d[1010][33];
int T, W, ans = -1;

int main() {
scanf("%d %d", &T, &W);
for (int i = 0; i < T; ++i) {
scanf("%d", &a[i]);
d[i][0] = (i ? d[i-1][0] : 0) + int(a[i] == 1);
}

for (int i = 0; i <= W; ++i)
d[0][i] = ((i & 1) == a[0] - 1);

for (int i = 1; i < T; ++i)
for (int j = 1; j <= W; ++j)
d[i][j] = max(d[i-1][j-1], d[i-1][j]) + ((j & 1) == a[i] - 1);
for (int i = 0; i <= W; ++i)
ans = max(ans, d[T-1][i]);
printf("%d\n", ans);
return 0;
}

Analysis

  1. 苹果每分钟从两棵树的其中一棵落下,在树1和树2间可以跳换给定次数,问最多可以接到多少苹果,初始在树1。
  2. d[i][j]表示到达i时刻,已换树j次,位于j%2+1号树下。转移d[i][j]=max(d[i-1][j],d[i-1][j-1])+((j&1)+1==a[i])。
# POJ

Comments

Your browser is out-of-date!

Update your browser to view this website correctly. Update my browser now

×