Pagini recente » Cod sursa (job #168353) | Cod sursa (job #1782899) | Cod sursa (job #814189) | Cod sursa (job #2251043) | Cod sursa (job #2135965)
#include <fstream>
#include <vector>
using namespace std;
ifstream in("asmax.in");
ofstream out("asmax.out");
const int N = 16001;
int n;
long long s[N];
bool viz[N];
vector <int> a[N];
void citire() {
in >> n;
int x, y;
for (int i = 1; i <= n; i++) in >> s[i];
while (in >> x >> y) {
a[x].push_back(y);
a[y].push_back(x);
}
in.close();
}
void dfs(int x) {
viz[x] = true;
for (int i = 0; i < a[x].size(); i++) {
if (!viz[ a[x][i] ]) {
dfs(a[x][i]);
if (s[ a[x][i] ] > 0) s[x] += s[ a[x][i] ];
}
}
}
int main()
{
long long m = 0;
citire();
for (int i = 1; i <= n; i++) {
if (!viz[i]) dfs(i);
}
for (int i = 1; i <= n; i++) m = max(m, s[i]);
out << m;
out.close();
}