Pagini recente » Cod sursa (job #1844071) | Cod sursa (job #1255374) | Istoria paginii runda/speed/clasament | Cod sursa (job #1083259) | Cod sursa (job #1444429)
#include <cstdio>
#include <vector>
using namespace std;
FILE *f,*g;
int d[16500],v[16500];
bool bf[16500];
vector <int> a[16500];
int n;
void dfs(int x)
{
bf[x] = true;
d[x] = v[x];
for (int i=0;i<a[x].size();i++)
if (bf[a[x][i]] == false)
{
dfs(a[x][i]);
if (d[a[x][i]]>0) d[x] += d[a[x][i]];
}
}
int main()
{
f=fopen("asmax.in","r");
g=fopen("asmax.out","w");
fscanf(f,"%d",&n);
for (int i=1;i<=n;i++) fscanf(f,"%d",&v[i]);
int x,y;
for (int i=1;i<n;i++)
{
fscanf(f,"%d%d",&x,&y);
a[x].push_back(y);
a[y].push_back(x);
}
dfs(1);
fprintf(g,"%d",d[1]);
return 0;
}