제출 #875645

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
875645		hmm789	Cat Exercise (JOI23_ho_t4)	C++14	21 / 100	2056 ms	201296 KiB

Main

#include <bits/stdc++.h>
using namespace std;
#define int long long
#define INF 1000000000000000000
#define MOD 998244353
 
vector<int> adj[200000];
int mx[5000][5000];
int dfs(int x, int l, int r) {
    int ans = 0;
    if(x != l) ans = max(ans, dfs(mx[l][x-1], l, x-1)+x-mx[l][x-1]);
    if(x != r) ans = max(ans, dfs(mx[x+1][r], x+1, r)+mx[x+1][r]-x);
    return ans;
}

int32_t main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    int n, x, y;
    cin >> n;
    int p[n];
    for(int i = 0; i < n; i++) cin >> p[i];
    for(int i = 0; i < n-1; i++) {
        cin >> x >> y;
        x--; y--;
        adj[x].push_back(y);
        adj[y].push_back(x);
    }
    for(int i = 0; i < n; i++) {
        for(int j = i; j < n; j++) {
            if(i == j) mx[i][j] = i;
            else if(p[mx[i][j-1]] > p[j]) mx[i][j] = mx[i][j-1];
            else mx[i][j] = j;
        }
    }
    cout << dfs(mx[0][n-1], 0, n-1);
}

• Subtask 1: 7 / 7
• Subtask 2: 7 / 7
• Subtask 3: 7 / 7
• Subtask 4: 0 / 10
• Subtask 5: 0 / 20
• Subtask 6: 0 / 23
• Subtask 7: 0 / 26