Cod sursa(job #2663988)
| Utilizator | Data | 27 octombrie 2020 18:40:26 | |
|---|---|---|---|
| Problema | Asmax | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.63 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("asmax.in");
ofstream g("asmax.out");
int n,v[16005],smax=-1e9;
bitset <16005> viz;
vector <int> V[16005];
void Dfs1(int x)
{
viz[x]=true;
smax=max(smax,v[x]);
for(int i=0; i<V[x].size(); i++)
if(!viz[V[x][i]])
Dfs1(V[x][i]),v[x]=max(v[x],v[x]+v[V[x][i]]),smax=max(smax,v[x]);
}
int main()
{
f>>n;
for(int i=1; i<=n; i++)
f>>v[i];
for(int i=1; i<n; i++)
{
int x,y;
f>>x>>y;
V[x].push_back(y);
V[y].push_back(x);
}
Dfs1(1);
g<<smax;
return 0;
}
