POJ3624

Posted on | In ,

Charm Bracelet

Solution sketch

0/1背包問題，需要優化記憶體使用量！

AC Code

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
26
27
28
29
30
31
32
33
34
35
#include <cstdio>
#include <cstring>
#include <vector>
using namespace std;
typedef pair<int, int> ii;
int dp[2][13000];
int main()
{
    int n, m;
    scanf("%d %d", &n, &m);
    ii inp[n + 1];
    for (int i = 1; i <= n; i++)
        scanf("%d %d", &inp[i].first, &inp[i].second);
    memset(dp, 0, sizeof(dp));
    for (int i = 1; i <= n; i++) {
        for (int j = 0; j <= m; j++) {
            if (j - inp[i].first < 0)
                dp[i % 2][j] = dp[(i % 2) ^ 1][j];
            else
                dp[i % 2][j] = max(dp[(i % 2) ^ 1][j],
                                   dp[(i % 2) ^ 1][j - inp[i].first] + inp[i].second);
        }
    }
    printf("%d\n", dp[n % 2][m]);
    return 0;
}