思路:根据题意可以知道只要不删除边就必定满足条件,那么只要暴力把全部特殊点放进队列广搜一边就好了。若当前边走过就返回,若当前边没走过且下一个点走过那么这条边是可以删除的。思路很容易,下面给代码:
#include<iostream>
#include<cmath>
#include<queue>
#include<cstdio>
#include<queue>
#include<algorithm>
#include<cstring>
#include<string>
#include<utility>
#include<map>
#include<vector>
#define maxn 300005
#define inf 0x3f3f3f3f
using namespace std;
typedef long long LL;
const double eps = 1e-8;
struct node{
int v, next;
}p[maxn << 1];
int head[maxn], len, vis1[maxn], vis2[maxn], ans[maxn], sum;
queue<int>q;
void addedge(int u, int v){
p[len].v = v;
p[len].next = head[u];
head[u] = len++;
}
void bfs(){
while (!q.empty()){
int now = q.front();
q.pop();
for (int i = head[now]; ~i; i = p[i].next){
if (vis2[i / 2 + 1])
continue;
vis2[i / 2 + 1] = 1;
if (vis1[p[i].v])
ans[sum++] = i / 2 + 1;
else{
vis1[p[i].v] = 1;
q.push(p[i].v);
}
}
}
}
int main(){
int n, k, d;
memset(head, -1, sizeof(head));
scanf("%d%d%d", &n, &k, &d);
for (int i = 1; i <= k; i++){
int x;
scanf("%d", &x);
vis1[x] = 1;
q.push(x);
}
for (int i = 0; i < n - 1; i++){
int u, v;
scanf("%d%d", &u, &v);
addedge(u, v);
addedge(v, u);
}
bfs();
printf("%d\n", sum);
if (sum)
printf("%d", ans[0]);
for (int i = 1; i < sum; i++)
printf(" %d", ans[i]);
printf("\n");
}