动态规划之完全背包算法模板

3. 完全背包问题 - AcWing题库

完全背包就是在01背包的基础上解除限制条件，可以一件物品不取也可以取得无穷件的物品。我们只需要在01背包基础上正序遍历，就可以保证我们可以取得背包能承载的最多的第i件物品

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);
int a=sc.nextInt();
int[] weight=new int[a+1];
int[] value=new int[a+1];
int b=sc.nextInt();
int[] dp=new int[b+1];
int c;
for(c=1;c<=a;c++) {
	weight[c]=sc.nextInt();
	value[c]=sc.nextInt();
}
int d,e;
for(c=1;c<=a;c++) {
	for(d=weight[c];d<=b;d++) {
		dp[d]=Math.max(dp[d], dp[d-weight[c]]+value[c]);
	}
}
System.out.println(dp[b]);
 }
}