Cod sursa(job #2199079)
| Utilizator | Data | 26 aprilie 2018 17:14:19 | |
|---|---|---|---|
| Problema | Asmax | Scor | 20 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.58 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("asmax.in");
ofstream out("asmax.out");
int n,v[16001],st[16001],dr[16001],suma,summax;
void sum(int nod){
suma+=v[nod];
if(suma>summax)
summax=suma;
for(int i=1;i<n;i++){
if(st[i]==nod)
sum(dr[i]);
}
}
int main()
{
int a,b;
in>>n;
for(int i=1;i<=n;i++)
in>>v[i];
for(int i=1;i<n;i++)
in>>st[i]>>dr[i];
for(int i=1;i<=n;i++){
suma=0;
sum(i);
}
out<<summax;
return 0;
}
