Submission #1357969

---

Source Code Expand

#include<iostream>
#include<vector>
#include<algorithm>
#include<cstring>
#include<cstdio>
#include<cmath>
#include<cstdlib>
#include<ctime>
#include<queue>
#include<set>
using namespace std;
typedef long long LL;
const int N=3010;
int gi() {
	int w=0;bool q=1;char c=getchar();
	while ((c<'0'||c>'9') && c!='-') c=getchar();
	if (c=='-') q=0,c=getchar();
	while (c>='0'&&c <= '9') w=w*10+c-'0',c=getchar();
	return q? w:-w;
}
int s[N],deg[N],q[N];
bool win[N];
int head[N],nxt[N],to[N];
int main()
{
	int n=gi(),i,a,b,tot=0,l=0,r=0,k;
	for (i=1;i<=n;i++) s[i]=gi();
	for (i=1;i<n;i++) {
		a=gi(),b=gi();
		if (s[a]>s[b]) swap(a,b);
		if (s[a]<s[b])
			deg[to[++tot]=b]++,nxt[tot]=head[a],head[a]=tot;
	}
	for (i=1;i<=n;i++) if (!deg[i]) q[++r]=i;
	while (l!=r)
		if (!win[k=q[++l]])
			for (i=head[k];i;i=nxt[i]) {
				win[to[i]]=true;
				if (!--deg[to[i]]) q[++r]=to[i];
			}
	for (i=1;i<=n;i++) if (win[i]) printf("%d ",i);
	return 0;
}

Submission Info

Judge Result