public static void solution3(){ Scanner in = new Scanner(System.in); int n = in.nextInt(); int m = in.nextInt(); in.nextLine(); int[][] mess = new int[m][3]; for(int i=0;i<m;i++){ mess[i][0] = in.nextInt(); mess[i][1] = in.nextInt(); mess[i][2] = in.nextInt(); } long[] dp =new long[n+1]; for(int i = 0;i<m;i++){ int start = mess[i][0]; int end =mess[i][1]; int bonus = mess[i][2]; for(int j = n;j>=end;j--){ dp[j] = Math.max(dp[j],dp[start]+(end-start+bonus)); } } System.out.println(dp[n]); }有没有佬能帮忙看看第三题为啥错呀，用例过了但是通过率0