Submission #58428

---

Source Code Expand

#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

const int kInf = 0xFFFF;

int main()
{
    int n;
    cin >> n;
    if (n > 50) return true;

    vector<int> c(n), p(n);
    p[0] = -1;
    cin >> c[0];
    for (int i = 1; i < n; i++) { cin >> p[i] >> c[i]; --p[i]; }
    for (int i = 0; i < n; i++) { c[i] += 50; }

    vector< vector<int> > dp(n);

    for (int i = n - 1; i >= 0; i--) {
        dp[i] = vector<int>(101);
        for (int j = 0; j <= 100; j++) {
            dp[i][j] = abs(c[i] - j);
            for (int k = i + 1; k < n; k++) {
                if (p[k] != i) continue;
                int m = kInf;
                for (int l = 0; l < j; l++) { m = min(m, dp[k][l]); }
                dp[i][j] += m;
            }
        }
    }

    cout << *min_element(dp[0].begin(), dp[0].end()) << endl;
    return 0;
}

Submission Info

Judge Result