#include <iostream>
#include <cstring>
#include <vector>
#define MAX 30001
using namespace std;
vector<short> edge[MAX];
bool del[MAX];
short sum[MAX];
short minNo[MAX];
short parent[MAX];
vector<int> get;
int golds, sons, leftGolds;
void init() {
memset(del, false, sizeof(del));
memset(sum, 1, sizeof(sum));
int a, b;
for(int i = 1; i <= golds - 1; i++) {
cin >> a >> b;
edge[a].push_back(b);
edge[b].push_back(a);
}
}
void dfsCount(int head, int father) {
sum[head] = 1;
minNo[head] = head;
parent[head] = father;
for(int i = 0; i < edge[head].size(); i++) {
int tmp = edge[head][i];
if(tmp == father || del[tmp]) {
continue;
}
dfsCount(tmp, head);
sum[head] += sum[tmp];
minNo[head] = min(minNo[head], minNo[tmp]);
}
}
void dfsDel(int head, int toNeglect) {
del[head] = true;
for(int i = 0; i < edge[head].size(); i++) {
int tmp = edge[head][i];
if(del[tmp] || tmp == toNeglect) {
continue;
}
dfsDel(tmp, toNeglect);
}
edge[head].clear();
}
void cut() {
while(get.size() < sons - 1) {
int mark, takenNum = 0, minimumNo = 30001;
int root = 1;
while(del[root]) {
root++;
}
dfsCount(root, 0);
for(int newRoot = 1; newRoot <= golds; newRoot++) {
if(newRoot == root || del[newRoot]) {
continue;
}
int part1 = sum[root] - sum[newRoot];
int part2 = sum[newRoot];
if(part1 == part2) {
mark = newRoot;
takenNum = part1;
break;
}
if(part1 < part2) {
if(part1 > takenNum || part1 == takenNum && minNo[root] < minimumNo) {
mark = newRoot;
takenNum = part1;
minimumNo = minNo[root];
}
}
else {
if(part2 > takenNum || part2 == takenNum && minNo[newRoot] < minimumNo) {
mark = newRoot;
takenNum = part2;
minimumNo = minNo[newRoot];
}
}
}
if(sum[mark] >= sum[root] - sum[mark]) {
dfsDel(root, mark);
}
else {
dfsDel(mark, parent[mark]);
}
get.push_back(takenNum);
leftGolds -= takenNum;
}
get.push_back(leftGolds);
}
int main() {
cin >> golds >> sons;
leftGolds = golds;
init();
cut();
for(int i = 0; i < sons - 1; i++) {
cout << get[i] << ' ';
}
cout << get[sons-1] << endl;
return 0;
}
1140. 国王的遗产
最新推荐文章于 2020-10-29 09:51:34 发布