CSP-2022-12-2（训练计划）

• 这个题我的代码虽然可以AC但是比较蠢，其实明白题意没必要写的这么复杂

• 最早开始时间是送分暂且不讲。最晚开始时间核心思想就是就是记录父子关系，最后只要根节点最晚能开始，其他节点都可以选择用最后的天数减去他们所需要的天数，换句话说如果将关系理解成为一棵树，这个题目就是想让你找每个节点开始的最大树深度，与限制时间做减法即可

#include <bits/stdc++.h>
#define endl '\n'
typedef long long ll;
using namespace std;
int n, m;
vector<int> rely(105);
vector<int> day(105);
vector<vector<int>> sons(105);
vector<int> earlier(105, 1);
vector<int> MAX(105);
vector<int> res(105, 0);
void dfs(int pos, int ans, int& mx) {
    ans += day[pos];
    for (auto i : sons[pos]) {
        dfs(i, ans, mx);
        mx = max(mx, ans);
    }
    mx = max(mx, ans);
}

void solve() {
    cin >> n >> m;
    for (int i = 1; i <= m; ++i) cin >> rely[i];
    for (int i = 1; i <= m; ++i) cin >> day[i];
    for (int i = 1; i <= m; ++i) {
        int tmp = i;
        while (rely[tmp] != 0) {
            earlier[i] += day[rely[tmp]];
            tmp = rely[tmp];
        }
        cout << earlier[i] << " ";
    } cout << endl;
    bool flag = true;
    for (int i = 1; i <= m; ++i) {
        if (earlier[i] + day[i] > n + 1) {
            flag = false;
            break;
        }
    }
    if (flag) {
        for (int i = 1; i <= m; ++i) {
            for (int j = 1; j <= m; ++j) {
                if (rely[j] == i) {
                    sons[i].push_back(j);
                }
            }
        }
        for (int i = 1; i <= m; ++i) {
            int mx = 0, ans = 0;
            dfs(i, ans, mx);
            MAX[i] = mx;
            // cout << i << ":" << mx << endl;
        }
        for (int i = 1; i <= m; ++i) {
            cout << n + 1 - MAX[i] << " ";
        }
    }
}
int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    solve();
    return 0;
}