Mai intai trebuie sa te autentifici.
Cod sursa(job #2184296)
Utilizator | Data | 23 martie 2018 22:00:18 | |
---|---|---|---|
Problema | Asmax | Scor | 10 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.85 kb |
#include <fstream>
#include <vector>
using namespace std;
ifstream fin("asmax.in");
ofstream fout("asmax.out");
int n,val[16003],viz[16003],smax;
vector<int>v[16003];
void dfs(int nod)
{
viz[nod]=1;
for(vector<int> :: iterator it=v[nod].begin();it!=v[nod].end();it++)
{
if(viz[*it]==0)
{
if(val[*it]>0)
val[nod]=val[nod]+val[*it];
dfs(*it);
}
}
}
int main()
{
fin>>n;
for(int i=1;i<=n;i++)
fin>>val[i];
for(int i=1;i<n;i++)
{
int x,y;
fin>>x>>y;
v[x].push_back(y);
v[y].push_back(x);
}
for(int i=1;i<=n;i++)
{
if(viz[i]==0)
{
dfs(i);
}
}
for(int i=1;i<=n;i++)
if(smax<val[i])
smax=val[i];
fout<<smax;
}