[USACO09OCT] Bessie‘s Weight Problem G Java

import java.util.*;
import java.io.*;

public class Main {
	public static void main(String[] args) throws IOException {
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		StringTokenizer st = new StringTokenizer(br.readLine());
		int H = Integer.parseInt(st.nextToken());
		int N = Integer.parseInt(st.nextToken());
		int[] s = new int[N + 1];
		for (int i = 1; i <= N; i++) s[i] = Integer.parseInt(br.readLine());
		int[] dp = new int[H + 1];
		for (int i = 1; i <= N; i++) {
			for (int j = H; j >=s[i]; j--) {
				dp[j] = Math.max(dp[j], dp[j - s[i]] + s[i]); // 01背包的最大价值在这里换成求最大体积           
			}
		}
		System.out.println(dp[H]);
	}
}

每日一水~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~