Pagini recente » Cod sursa (job #542205) | Cod sursa (job #2346245) | Cod sursa (job #1511367) | Cod sursa (job #621135) | Cod sursa (job #1915932)
#include <fstream>
#include <vector>
using namespace std;
ifstream fin("asmax.in");
ofstream fout("asmax.out");
vector <int> g[16001];
int n;
int v[16001], d[16001];
bool viz[16001]={0};
void citire()
{
int i, j, k;
fin>>n;
for(i=1; i<=n; i++)
fin>>v[i];
for(k=1; k<n; k++)
{
fin>>i>>j;
g[i].push_back(j);
g[j].push_back(i);
}
fin.close();
}
void dfs(int nod)
{
viz[nod]=1;
vector <int> :: iterator it;
d[nod]=v[nod];
for(it=g[nod].begin(); it!=g[nod].end(); it++)
if(!viz[*it])
{
dfs(*it);
if(d[*it]>0)
d[nod]+=d[*it];
}
}
int main()
{
citire();
dfs(1);
fout<<d[1]<<'\n';
fout.close();
return 0;
}