Submission #1589025

---

Source Code Expand

#include <bits/stdc++.h>
#define rep(i, a, n) for(int i = a; i < n; i++)
#define REP(i, n) rep(i, 0, n)
#define repb(i, a, b) for(int i = a; i >= b; i--)
#define all(a) a.begin(), a.end()
#define int long long
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
using namespace std;
typedef pair<int, int> P;
const int mod = 1000000007;
const int INF = 1e12;

int n, k;
vector<int> G[51];
int d[51];
int MAX = 0;

void dfs(int now, int pre, int sum, vector<bool> f){
    f[now] = true;
    chmax(MAX, sum);
    rep(i, 0, G[now].size()){
        int next = G[now][i];
        if(next == pre || f[next]) continue;
        chmax(MAX, sum + d[next]);
        dfs(next, now, sum + d[next], f);
    }
}

signed main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cin >> n >> k;
    rep(i, 0, n) cin >> d[i];
    rep(i, 0, k){
        int x, y;
        cin >> x >> y;
        x--; y--;
        G[x]. push_back(y);
        G[y]. push_back(x);
    }
    rep(i, 0, n){
        vector<bool> g(n, false);
        dfs(i, -1, d[i], g);
    }
    cout << MAX << endl;
}

Submission Info

Judge Result