Pagini recente » Cod sursa (job #121731) | Cod sursa (job #658239) | Cod sursa (job #2257777) | Cod sursa (job #1609667) | Cod sursa (job #3281009)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("asmax.in");
ofstream fout("asmax.out");
/**
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
*/
int n, v[16003], cnt, sum, maxx, summax;
vector <int> g[16003];
//bitset <16003> viz;
void DFS(int x, int viz[])
{
viz[x] = 1;
maxx = max(maxx, cnt + v[x]);
cnt += v[x];
for (int i : g[x])
if (viz[i] == 0)
DFS(i, viz);
}
void F(int j)
{
int i, viz[16003] = {0};
sum = 0;
viz[j] = 1;
for (int i : g[j])
{
cnt = maxx = 0;
DFS(i, viz);
//fout << maxx << " ";
sum += maxx;
}
}
int main()
{
ios_base::sync_with_stdio(0);
fin.tie(0);
fout.tie(0);
int i, j, x, y;
fin >> n;
for (i = 1; i <= n; i++)
fin >> v[i];
for (i = 1; i < n; i++)
{
fin >> x >> y;
g[x].push_back(y);
g[y].push_back(x);
}
for (j = 1; j <= n; j++)
{
F(j);
summax = max(summax, v[j] + sum);
/**sum = 0;
viz[j] = 1;
for (int i : g[j])
{
cnt = maxx = 0;
DFS(i);
//fout << maxx << " ";
sum += maxx;
}
summax = max(summax, v[j] + sum);
for (i = 1; i <= n; i++)
viz[i] = 0;*/
}
fout << summax << "\n";
return 0;
}