ccf 202212-2训练计划

#include<iostream>

using namespace std;
int main() {
    int daynum, jobnum;
    int yilai[100], needday[100];
    int earlest[100], latest[100];
    int maxday = 0;
    cin >> daynum >> jobnum;
    for (int i = 0; i < jobnum; i++) {
        cin >> yilai[i];
    }
    for (int i = 0; i < jobnum; i++) {
        cin >> needday[i];
    }

    for (int i = 0; i < jobnum; i++) {
        if (yilai[i] == 0) earlest[i] = 1; //不依赖任何项目，最早可从第一天开始
        else {
            earlest[i] = earlest[yilai[i]-1]+needday[yilai[i] - 1] ;//最早从依赖项结束时开始
            if (maxday < earlest[i] + needday[i]) maxday = earlest[i] + needday[i];//更新最晚结束时间
        }
    }
    for (int i = 0; i < jobnum; i++) {
        cout << earlest[i] << ' ';
    }
    cout << endl;
    if (maxday > daynum) return 0;//不能按时完成，结束

    for (int i = jobnum - 1; i >= 0; i--) {//题目规定只有后项依赖前项，所以最晚开始时间从最后任务开始向前遍历。
        int f=0;
        int temp = 999;
        for (int j = 0; j < jobnum; j++) {//可能有多项依赖本项，找到最晚开始时间最早的
            if (yilai[j] == i + 1 && temp > latest[j]) {
                f = j;
                temp = latest[j];
            }
        }
        if (f == 0) {//没有依赖本项
            latest[i] = daynum - needday[i]+1;
        }
        else {//依赖本项中最晚开始时间最早的时间减去本项所需时间
            latest[i] = temp - needday[i];
        }

    }
    for (int i = 0; i < jobnum; i++) {
        cout << latest[i] << ' ';
    }


}