大致题意:
找出最大的集合满足以下要求:
1.
1.
1. 集合中所有点在原图中是连通图
2.
2.
2. 集合中权值大小相邻的两个点,它们路径上其它点的权值均小于起点权值。
解题报告:
题意转化为 从权值小的点出发最多能达到的点数??
那么我们可以将无向图建成有向图即权值小的指向权值大的。
dfs,bfs 都可做
代码展示:
#include<bits/stdc++.h>
#define LL long long
#define pii pair<LL,int>
#define all(x) x.begin(),x.end()
#define wp(x) write(x),putchar('\n')
#define wpl(x) write(x),putchar(' ')
#define mem(a,b) memset(a,b,sizeof(a))
using namespace std;
const int maxn = 5e5 + 5;
const int MOD = 998244353;
inline int read() {
int s = 0, f = 1;
char ch = getchar();
while (ch < '0' || ch > '9') {if (ch == '-') f = -1; ch = getchar();}
while (ch >= '0' && ch <= '9') {s = (s << 1) + (s << 3) + ch - '0'; ch = getchar();}
return s * f;
}
inline void write(LL x) {
if (x < 0) putchar('-'), x = -x;
if (x > 9) write(x / 10);
putchar(x % 10 + '0');
}
int n, m, k, f[maxn], sz[maxn];
struct TMD {
int to, next;
} edge[maxn << 1];
int head[maxn], cnt, a[maxn], num[maxn];
void add(int from, int to) {
edge[++cnt] = {to, head[from]}; head[from] = cnt;
}
void dfs(int now) {
if (num[now]) return;
for (int i = head[now]; i; i = edge[i].next) {
int to = edge[i].to;
dfs(to);
num[now] += num[to];
}
num[now]++;
}
int main() {
int u, v;
while (scanf("%d", &n) != EOF) {
for (int i = 1; i <= n; i++) head[i] = 0, num[i] = 0;
for (int i = 1; i <= n; i++) a[i] = read();
for (int i = 1; i < n; i++) {
u = read(); v = read();
if (a[u] < a[v]) add(u, v);
else add(v, u);
}
int ans = 1;
for (int i = 1; i <= n; i++) {
if (!num[i]) dfs(i);
ans = max(ans, num[i]);
}
wp(ans);
}
return 0;
}