记录编号	569040	评测结果	AAAAAAAAAA
题目名称	挖地雷	最终得分	100
用户昵称	lihaoze	是否通过	通过
代码语言	C++	运行时间	0.000 s
提交时间	2022-02-13 23:09:48	内存使用	0.00 MiB

#include <iostream>
#include <vector>
#include <cstring>
#include <string>
#include <algorithm>
#define OPEN(_x) freopen(#_x".in", "r", stdin); freopen(#_x".out", "w", stdout)
#define ABS(_x) ((_x)<0?(-(_x)):(_x))
#define MAX(_a, _b) ((_a)<(_b)?(_b):(_a))
#define MIN(_a, _b) ((_a)>(_b)?(_b):(_a))
#define fi first
#define se second

using namespace std;

typedef long long ll;
typedef pair<int, int> PII;

namespace IO{
    template<typename T>
    inline T read() {
        T ret=0, sig=1; char ch=0;
        while(ch<'0'||ch>'9') { if(ch=='-') sig=-1; ch=getchar(); }
        while(ch>='0'&&ch<='9') { ret=(ret<<1)+(ret<<3)+ch-'0'; ch=getchar(); }
        return ret*sig;
    }
    template<typename T>
    inline void read(T &x) {
        T ret=0, sig=1; char ch=0;
        while(ch<'0'||ch>'9') { if(ch=='-') sig=-1; ch=getchar(); }
        while(ch>='0'&&ch<='9') { ret=(ret<<1)+(ret<<3)+ch-'0'; ch=getchar(); }
        x = ret*sig;
    }
    template<typename T>
    inline void write(T x) {
        if(x<0) putchar('-'), x=-x;
        T stk[100], tt=0;
        do stk[tt++]=x%10, x/=10; while(x);
        while(tt) putchar(stk[--tt]+'0');
    }
};

const int N = 10010;
int a[N], f[N];
int fa[N];
int n;

int h[N], ne[N], e[N], idx;
inline void add(int _a, int _b) { e[idx] = _b, ne[idx] = h[_a], h[_a] = idx++; }

void dfs(int x) {
    if(!x) return;
    if(fa[x]) dfs(fa[x]);
    IO::write(x), putchar('-');
}

int main() {
    #ifdef DEBUG
    OPEN(test);
    #endif
    OPEN(landmine);
    memset(h, -1, sizeof h);
    IO::read(n);
    for(register int i = 1; i<=n; ++i) IO::read(a[i]);
    int _a, _b;
    while(scanf("%d%d", &_a, &_b)==2, _a || _b) add(_b, _a);
    int mx = 0;
    for(register int i = 1; i<=n; ++i) {
        f[i] = a[i];
        for(register int j = h[i]; j != -1; j = ne[j]) {
            int x = e[j];
            if(f[x]+a[i] > f[i]) fa[i] = x, f[i] = f[x] + a[i];
        }
        if(f[i] > f[mx]) mx = i; 
    }
    dfs(fa[mx]);
    IO::write(mx);
    puts("");
    IO::write(f[mx]);
    return 0;
}