总结:
1.涉及到图的时候一定要考虑a和b,b和c,那么a和c也有联系
2.就是把1 2 3 4 5 换成A B C D E问题就复杂好多
3.读题!!!!
代码
#include<iostream>
#include<vector>
#include<map>
#include<algorithm>
#include<string>
using namespace std;
int vi[3000]; //判断是否访问过
int g = 1;
struct node{
string name;
vector<node> next;
int biansum; //一个点的所有边之和
int index;
node()
{
index = 0; //必须设定处置
biansum = 0;
}
};
int n, k;
struct node2{ //符合要求的head和num
string s;
int num;
node2(string a, int b){
s = a; num = b;
}
}; vector<node2> sss;
vector<string> no; //存储出现的所有节点名字字符串
int num = 0;int area = 0; string ph; int sum = 0; int maxsum = 0;//num用于记录一个网络的人数,area记录一共有几个网络,ph记录网络里的head,sum记录总relation,maxsum用于找head
map<string, node> sp; //建立点和string之间联系
bool cmp(node2 a, node2 b)
{
if (a.s < b.s)return true;
else return false;
}
void dfs(string s)
{
if (vi[sp[s].index] == 1)return;
num++;
sum += sp[s].biansum;
if (sp[s].biansum > maxsum){ ph = s; maxsum = sp[s].biansum; }
vi[sp[s].index] = 1;
for (int i = 0; i < sp[s].next.size(); i++)
{
dfs(sp[s].next[i].name);
}
}
int main()
{
cin >> n >> k;
for (int i = 1; i <= n; i++)
{
string a, b; int c;
cin >> a >> b >> c;
if (sp[a].index == 0)sp[a].index = g++; //编号
if (sp[b].index == 0)sp[b].index = g++;
sp[a].name = a; sp[a].biansum += c;//累计点权
sp[b].name = b; sp[b].biansum += c;
sp[b].next.push_back(sp[a]); (sp[a].next).push_back(sp[b]);
no.push_back(a); no.push_back(b);
}
for (int i = 0; i < no.size(); i++)
{
num = 0; ph = "0"; sum = 0; maxsum = 0;
if (vi[sp[no[i]].index] == 0)
{
dfs(no[i]);
if (num>2 && sum / 2>k){ area++; node2 pu(ph, num); sss.push_back(pu); }
}
}
if (area == 0)cout << "0";
else{
cout << area << endl; sort(sss.begin(), sss.end(), cmp);
for (int i = 0; i < sss.size(); i++)
{
cout << sss[i].s << " " << sss[i].num;
if (i != sss.size() - 1)cout << endl;
}
}
return 0;
}