import java.util.Arrays; import java.util.Scanner; public class Main { public static int solution(int V, int[][] wuping) { int[] dp = new int[V + 1]; for (int i = 1; i <= V; i++) { for (int j = 0; j < wuping.length; j++) { int[] item = wuping[j]; if (i >= item[0]) { dp[i] = Math.max(dp[i], ...