Cod sursa(job #997805)
#include <fstream>
#include <vector>
using namespace std;
ifstream f("asmax.in");
ofstream g("asmax.out");
int N;
int SumMax[16002];
bool Use[16002];
vector <int> G[16002];
int Value[16002];
void Read()
{
int i;
f>>N;
for(i=1;i<=N;i++)
f>>Value[i];
for(i=1;i<=N-1;i++)
{
int x,y;
f>>x>>y;
G[x].push_back(y);
G[y].push_back(x);
}
}
void DFS(int nod)
{
Use[nod]=1;
SumMax[nod]=Value[nod];
for(unsigned int i=0;i<G[nod].size();i++)
{
int vecin=G[nod][i];
if(Use[vecin]==0)
{
DFS(vecin);
SumMax[nod]=max(SumMax[nod],SumMax[nod]+SumMax[vecin]);
}
}
}
void Solve()
{
int i,maximum=-160000000;
for(i=1;i<=N;i++)
maximum=max(maximum,SumMax[i]);
g<<maximum<<"\n";
}
int main()
{
Read();
DFS(1);
Solve();
return 0;
}