Pagini recente » Cod sursa (job #30198) | Cod sursa (job #23032) | Cod sursa (job #2942806) | Cod sursa (job #2289319) | Cod sursa (job #2218091)
#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
const int NMax = 15001;
const int INF = -2e9;
ifstream in("asmax.in");
ofstream out("asmax.out");
vector <int> a[NMax];
vector <int> valori;
vector <int> d;
//int d[NMax];
bool viz[NMax];
int N;
void citire(){
in>>N;
valori.push_back(INF);
for(int i=1;i<=N;i++){
int k; in>>k; valori.push_back(k);
viz[i]=false;
}
int x,y;
for(int i=1; i<N;i++){
in>>x>>y;
a[x].push_back(y);
}
}
void dfs(int x){
viz[x]=true;
for(int i=0; i<a[x].size(); i++){
int y = a[x][i];
if(true){
dfs(y);
if(d[y]>0){
d[x]+=d[y];
}
}
}
}
int main()
{
citire();
int sumMax = INF;
for(int i=1; i<=N; i++){
d = valori;
dfs(i);
for(int i=1; i<=N; i++) cout<<d[i]<<" ";
cout<<endl;
sumMax = max(sumMax, d[i]);
}
out<<sumMax;
return 0;
}