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();
    }

}


發表評論
所有評論
還沒有人評論,想成為第一個評論的人麼? 請在上方評論欄輸入並且點擊發布.
相關文章