Pagini recente » Cod sursa (job #2499595) | Cod sursa (job #2230878) | Cod sursa (job #1922920) | Cod sursa (job #74634) | Cod sursa (job #2136006)
#include<fstream>
#include<vector>
using namespace std;
const int MAX=1e4+1;
vector<int> a[MAX];
bool viz[MAX];
int n, m, v[MAX], mxm=-999999999;
ifstream cin("asmax.in");
ofstream cout("asmax.out");
void citire(){
cin>>n;
int x, y, k;
for(int i=1; i<=n; i++){
cin>>k;
v[i]=k;
}
for(int i=0; i<n; i++){
cin>>x>>y;
a[x].push_back(y);
a[y].push_back(x);
}
cin.close();
}
void dfs(int x){
viz[x]=true;
int y;
for(int i=0; i<a[x].size(); i++){
y=a[x][i];
if(viz[y]){
dfs(y);
if(v[y]>0){
v[x]+=v[y];
//mxm=max(v[x], mxm);
}
}
}
}
int main(){
citire();
//int nr=0;
for(int i=1; i<=n; i++){
if(!viz[i]){
dfs(i);
//++nr;
}
}
dfs(1);
for(int i=1; i<=n; i++)
if(v[i]>mxm)
mxm=v[i];
cout<<mxm;
cout.close();
return 0;
}