Pagini recente » Cod sursa (job #1444261) | Cod sursa (job #1621355) | Cod sursa (job #2024320) | Cod sursa (job #412949) | Cod sursa (job #834568)
Cod sursa(job #834568)
#include <fstream>
#include <vector>
#include <string.h>
using namespace std;
ifstream in("asmax.in");
ofstream out("asmax.out");
int cost[16001];
vector<int> liste[16001];
bool viz[16001];
int DFS(int x){
viz[x]=true;
int sum=cost[x];
for (vector<int>::iterator i=liste[x].begin();i!=liste[x].end();i++){
if (!viz[*i]){
int rezultat=DFS(*i);
if (rezultat>0)
sum+=rezultat;
}
}
return sum;
}
int main(){
int n;
in>>n;
int x1,x2;
for (int i=1;i<=n;i++)
in>>cost[i];
for (int i=1;i<=n-1;i++){
in>>x1>>x2;
liste[x2].push_back(x1);
liste[x1].push_back(x2);
}
int max=-10001;
for (int i=1;i<=n;i++){
if (viz[i]) continue;
int result=DFS(i);
if (max<result)
max=result;
}
out<<max;
return 0;
}