动态规划之分组背包模板

P1757 通天之分组背包 - 洛谷 | 计算机科学教育新生态 (luogu.com.cn)

分组背包模板题，我使用了ArrayList来存储每组的物品，大家可以看看。本题的坑点在于是没告诉你组的编号可以从0开始，真不地道。我们特判一下ArrayList是否为空。

import java.awt.FontFormatException;
import java.io.BufferedReader; 
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.lang.reflect.AnnotatedWildcardType;
import java.math.BigInteger;
import java.net.DatagramPacket;
import java.sql.SQLIntegrityConstraintViolationException;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.Comparator;
import java.util.HashMap;
import java.util.HashSet;
import java.util.LinkedHashSet;
import java.util.LinkedList;
import java.util.Map;
import java.util.Objects;
import java.util.PriorityQueue;
import java.util.Scanner;
import java.util.Spliterator.OfPrimitive;
import java.util.function.IntToDoubleFunction;
import java.util.function.LongBinaryOperator;
import java.util.TreeMap;
import java.util.TreeSet;
import javax.management.relation.InvalidRelationTypeException;
import javax.print.attribute.standard.JobMessageFromOperator;
import javax.print.attribute.standard.JobPriority;
import javax.swing.table.TableModel;
import javax.swing.text.TabSet;
public class Main {
  public static void main(String[] args) throws IOException  {
Scanner sc=new Scanner(System.in);
BufferedReader br1=new BufferedReader(new InputStreamReader(System.in));
PrintWriter pw1=new PrintWriter(System.out);
String[] aStrings=br1.readLine().split(" ");
int a=Integer.parseInt(aStrings[0]);
int b=Integer.parseInt(aStrings[1]);
int[] dp=new int[a+1];
int c;
ArrayList<sss>[] al1=new ArrayList[b+10];
int g=0;
for(c=1;c<=b;c++) {
String[] bStrings=br1.readLine().split(" ");
int d=Integer.parseInt(bStrings[0]);
int e=Integer.parseInt(bStrings[1]);
int f=Integer.parseInt(bStrings[2]);
sss ss=new sss(d, e, f);
if(al1[f]==null) {
	al1[f]=new ArrayList<>();
	al1[f].add(ss);
	g++;
	
}
else {
	al1[f].add(ss);
}
}

//System.out.println(al1[1].get(0).a);
for(c=0;c<=g;c++) {
	if(al1[c]!=null)
	{
	for(int h=a;h>=0;h--) {
		//System.out.println(c);
		for(int i=0;i<al1[c].size();i++) {
			
			if(h>=al1[c].get(i).a) {
				dp[h]=Math.max(dp[h], dp[h-al1[c].get(i).a]+al1[c].get(i).b);
				
			}
		}
	}
}
}
System.out.println(dp[a]);
 }
}
class sss{
	int a;
	int b;
	int id;
	public sss(int a, int b, int id) {
		super();
		this.a = a;
		this.b = b;
		this.id = id;
	}
	
}