Pagini recente » Cod sursa (job #669868) | Cod sursa (job #1229431) | Cod sursa (job #155729) | Cod sursa (job #2342912) | Cod sursa (job #1806393)
#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
ifstream fin("asmax.in");
ofstream fout("asmax.out");
#define lim 16010
int n,m;
vector <int> G[lim];
int ini[lim],ssm[lim],viz[lim];
void dfs(int nod)
{
viz[nod]=1;
ssm[nod]=ini[nod];
for(auto it:G[nod])
{
if(!viz[it])
{
dfs(it);
ssm[nod]+=max(ssm[it],0);
}
}
}
int main()
{
int x,y,i;
fin>>n>>m;
for(i=1; i<=n; i++)
fin>>ini[i];
for(i=1; i<=m; i++)
{
fin>>x>>y;
G[x].push_back(y);
G[y].push_back(x);
}
dfs(1);
rez=-2000000000;
for(i=1; i<=n; i++)
if(ssm[i]>rez)
rez=ssm[i];
fout<<rez;
return 0;
}