Pagini recente » Cod sursa (job #1078648) | Cod sursa (job #2240311) | Cod sursa (job #2998721) | Cod sursa (job #695185) | Cod sursa (job #2506016)
#include <fstream>
using namespace std;
ifstream in("asmax.in");
ofstream out("asmax.out");
int n,st,dr,lst[16009],urm[16009],vf[16009],nr;
long long v[16009];
bool viz[16009];
void adauga(int x, int y)
{
vf[++nr]=y;
urm[nr]=lst[x];
lst[x]=nr;
}
void dfs(int x)
{
viz[x]=true;
for(int p=lst[x]; p!=0; p=urm[p])
{
int y=vf[p];
if(!viz[y])
{
dfs(y);
if(v[y]>0) v[x]+=v[y];
}
}
}
int main()
{
in>>n;
for(int i=1; i<=n; i++) in>>v[i];
for(int i=1; i<=n-1; i++)
{
in>>st>>dr;
adauga(st,dr);
adauga(dr,st);
}
//for(int i=1; i<=n; i++) if(!viz[i]) dfs(i);
dfs(1);
long long ans=-1009;
for(int i=1; i<=n; i++) if(v[i]>ans) ans=v[i];
out<<ans;
return 0;
}