Pagini recente » Cod sursa (job #2750906) | Cod sursa (job #399715) | Cod sursa (job #1916993) | Cod sursa (job #155109) | Cod sursa (job #1480206)
#include<fstream>
#include<vector>
using namespace std;
ifstream f("asmax.in");
ofstream g("asmax.out");
const int nmax=16005;
vector<int>q[nmax];
int n,val[nmax];
bool viz[nmax];
void dfs(int tata)
{
int i,fiu;
viz[tata]=1;
for(i=0;i<q[tata].size();i++)
{
fiu=q[tata][i];
if(viz[fiu]==0)
{
dfs(fiu);
if(val[fiu]>0)
val[tata]+=val[fiu];
}
}
}
int main()
{
int i,n,x,y,sol=-10000000;
f>>n;
for(i=1;i<=n;i++)
f>>val[i];
for(i=1;i<n;i++)
{
f>>x>>y;
q[x].push_back(y);
q[y].push_back(x);
}
dfs(1);
for(i=1;i<=n;i++)
if(val[i]>sol)
sol=val[i];
g<<sol;
return 0;
}