背包解决购物清单

import java.util.Scanner;

public class Main {
	public static void main(String[] args) {
		Scanner scan = new Scanner(System.in);
		while (scan.hasNext()) {
			int n = scan.nextInt();// 总钱数
			int m = scan.nextInt();// 购买的物品总数
			int[] price = new int[m + 1];// 物品价格
			int[] q = new int[m + 1];	
			int[] value = new int[m + 1];
			int temp = 0;
			for (int i = 1; i < m + 1; i++) {
				price[i] = scan.nextInt();// 物品价格
				temp = scan.nextInt();// 物品重要程度
				value[i] = price[i] * temp;// 物品价值
				q[i] = scan.nextInt();// q=0表示为主件，q!=0表示q所属的主件的编号
			}
			findMax(price, value, q, n, m);
		}
	}

	public static void findMax(int[] price, int[] value, int[] q, int n, int m) {
		int[][] result = new int[m + 1][n + 1];
		for (int i = 1; i <= m; i++) {// i表示物品数量
			for (int j = 1; j <= n; j++) {// j表示钱数
				if (q[i] == 0) {
					if (price[i] > j) {
						result[i][j] = 0;// result[i][j] = result[i-1][j];
					} else {
						result[i][j] = Math.max(result[i - 1][j - price[i]] + value[i], result[i - 1][j]);
					}
				} else {
					if (price[i] + price[q[i]] > j) {
						result[i][j] = 0;
					} else {
						result[i][j] = Math.max(result[i - 1][j - price[i]] + value[i], result[i - 1][j]);
					}
				}
			}
		}
		System.out.println(result[m][n]);
	}
}