CSP202212-2 训练计划 java 满分解法

 

 

import java.util.Scanner;

public class Main {
    public static void main(String[] args){
        M();
    }
    public static int M(){
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();//天数
        int m = sc.nextInt();//科目数
        int[] p = new int[m+1];
        int[] t = new int[m+1];
        int[] ea = new int[m+1];
        int[] la = new int[m+1];
        int min_latest;
        int key = 1;
        for (int i = 1; i <= m; i++) {
            p[i] = sc.nextInt();
        }
        for (int i = 1; i <= m; i++) {
            t[i] = sc.nextInt();
        }


        for (int i = 1; i <= m; i++) {
            if (p[i] == 0){
                ea[i] = 1;

            }else {
                ea[i] = ea[p[i]] + t[p[i]];
            }
            if ((ea[i] + t[i] -1)>n){
                key = 0;
            }
        }

        if(key==1){
            for (int i = m; i >=1 ; i--) {
                min_latest = n - t[i] +1;
                for (int j = m; j > i; j--) {
                    if (p[j] == i) {
                        min_latest = Math.min(min_latest, la[j] - t[i]);//无需+1 当天不算
                    }
                }
                la[i] = min_latest;
            }
        }

        for (int i = 1; i <= m; i++) {
            System.out.print(ea[i] + " ");
        }
        System.out.println();
        if(key == 1){
            for (int i = 1; i <= m; i++) {
                System.out.print(la[i]+ " ");
            }

        }
        return 0;
    }

}