| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 296398 | morato | Traffic (IOI10_traffic) | C++17 | 0 ms | 0 KiB | 
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e6 + 5;
vector<int> adj[maxn];
int p[maxn], h[maxn], sub[maxn], tot;
void dfs(int v, int _p = -1) {
  for (int u : adj[v]) if (u != _p) {
    dfs(u, v);
    sub[v] += sub[u] + p[u];
    h[v] = max(h[v], sub[u] + p[u]);
  }
}
int LocateCentre(int N, int *P, int *S, int *D) {
  for (int i = 0; i < N; i++) {
    adj[S[i]].push_back(D[i]);
    adj[D[i]].push_back(S[i]);
  }
  dfs(0);
  int ans = 0, heavy = h[0];
  for (int i = 1; i < N; i++) {
    h[i] = max(h[i], tot - sub[i] - p[i]);
    if (h[i] < heavy) {
      heavy = h[i];
      ans = i;
    }
  }
  return ans;
}
int main() {
  int n;
  cin >> n;
  for (int i = 0; i < n; i++) {
    cin >> p[i];
    tot += p[i];
  }
  for (int i = 0; i < n - 1; i++) {
    cin >> s[i] >> d[i];
  }
  cout << LocateCentre(n, p, s, d) << '\n';
  return 0;
}
