Pagini recente » Cod sursa (job #1528763) | Cod sursa (job #2773476) | Cod sursa (job #182355) | Cod sursa (job #1481698) | Cod sursa (job #1561295)
#include<fstream>
#include<vector>
using namespace std;
ofstream fout("asmax.out");
ifstream fin("asmax.in");
constexpr int NMAX = 16005;
int n, x, y;
int valori[NMAX], viz[NMAX], sol[NMAX];
vector<int> Graf[NMAX];
int DFS(int nod)
{
viz[nod] = 1;
for(const auto & nouNod : Graf[nod])
if(viz[nouNod] != 1)
valori[nod] += max(DFS(nouNod), 0);
return valori[nod];
}
int main()
{
fin >> n;
for(int i = 1; i <= n; i++)
fin >> valori[i];
while(fin >> x >> y) {
Graf[x].push_back(y);
Graf[y].push_back(x);
}
fout << DFS(1) << '\n';
return 0;
}