import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int[] pi = new int[n+1];
int[] ai = new int[n+1];
int[] qi = new int[n+1];
int[] bi = new int[n+1];
for (int i = 1; i <= n; i++) {
pi[i] = sc.nextInt();
ai[i] = sc.nextInt();
qi[i] = sc.nextInt();
bi[i] = sc.nextInt();
}
int[][] dp = new int[n+1][121];
for(int i=1;i<=n;i++){
for(int j=1;j<=120;j++){
if(j<pi[i])
dp[i][j] = dp[i-1][j];
else if(j<qi[i])
dp[i][j] = Math.max(dp[i-1][j],dp[i-1][j-pi[i]]+ai[i]);
else
dp[i][j] = Math.max(dp[i-1][j],Math.max(dp[i-1][j-pi[i]]+ai[i],dp[i-1][j-qi[i]]+bi[i]));
}
}
System.out.print(dp[n][120]);
}
}
考试策略
最新推荐文章于 2019-09-04 00:23:34 发布