import java.util.Scanner;
public class Main {
public static void main(String[] args){
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int m = sc.nextInt();
int T = sc.nextInt();
int[][] dp = new int[n+1][n+1];
int[] value = new int[n+1];
for(int i = 1;i<=n;i++){
value[i] = sc.nextInt();
}
int[] time = new int[T+1];
for(int i = 1;i<=T;i++){
time[i] = sc.nextInt();
}
for(int i = 1;i<=n;i++){
for(int j = m;j >= 1;j--){
dp[i][j] = Math.max(dp[i-1][j],dp[i-1][j-1]+value[i]);
}
}
for(int i = 1;i <= T;i++){
int ans = dp[time[i]][m];
System.out.println(ans);
}
}
}
试题名称 算法提高 学生节 Java
最新推荐文章于 2024-10-04 20:45:38 发布