POJ_3624 Charm Bracelet

0，1背包问题、这里卡了二维的情况、

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.io.PrintWriter;
import java.io.StreamTokenizer;

public class Poj_3624_1 {

    static StreamTokenizer in = new StreamTokenizer(new BufferedReader(new InputStreamReader(System.in)));
    static PrintWriter out = new PrintWriter(new OutputStreamWriter(System.out));

    public static int nextInt() throws IOException {
        in.nextToken();
        return (int) in.nval;
    }

    public static String next() throws IOException {
        in.nextToken();
        return (String) in.sval;
    }

    public static void main(String[] args) throws IOException {
        int N = nextInt();
        int M = nextInt();
        
        int w[] = new int[N + 1];
        int d[] = new int[N + 1];
        int value[] = new int[M + 1];
        for(int i = 1; i <= N; i++){
            w[i] = nextInt();
            d[i] = nextInt();
        }
        for(int i = 1; i <= N; i++){
            for(int k = M; k >= w[i]; k--){  // 人人为我模式 、、、
                if(value[k - w[i]] + d[i] > value[k]){  //　　放的价值大于不放的、、
                    value[k] = value[k - w[i]] + d[i];
                }
            }
        }
        
        out.println(value[M]);
        out.flush();
    }

}

二维数字存、本地测试对的、但是oj卡

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.io.PrintWriter;
import java.io.StreamTokenizer;

public class Poj_3624 {

    static StreamTokenizer in = new StreamTokenizer(new BufferedReader(new InputStreamReader(System.in)));
    static PrintWriter out = new PrintWriter(new OutputStreamWriter(System.out));

    public static int nextInt() throws IOException {
        in.nextToken();
        return (int) in.nval;
    }

    public static String next() throws IOException {
        in.nextToken();
        return (String) in.sval;
    }

    public static void main(String[] args) throws IOException {
        int N = nextInt();
        int M = nextInt();

        int[] w = new int[N + 1];  // 质量 、、
        int[] d = new int[N + 1]; // 价值、、

        int dp[][] = new int[N + 1][M + 1];

        for (int i = 1; i <= N; i++) {
            w[i] = nextInt();  //输入重量、、、
            d[i] = nextInt(); // 输入价值、、、
        }

        for (int i = 1; i <= N; i++) { // 第 i 件 物品 进行判断、、
            for(int j = 0; j <= M; j++){ //　对当前的价值　判断、、、
                if(w[i] <= j){  // 放的下去、、、
                    if(dp[i - 1][j - w[i]] + d[i] > dp[i - 1][j]){
                        dp[i][j] = dp[i - 1][j - w[i]] + d[i];
                    }else{
                        dp[i][j] = dp[i - 1][j];
                    }
                }else{
                    dp[i][j] = dp[i - 1][j];
                }
            }
        }
        
        out.println(dp[N][M]);
        out.flush();
    }

}