algzjh的博客

Agri-NetTime Limit: 1000MSMemory Limit: 10000KTotal Submissions: 52488Accepted: 21880DescriptionFarmer John has been elected mayor of his town! One of his campa

HighwaysTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 28779Accepted: 13132DescriptionThe island nation of Flatopia is perfectly flat. Unfortunately,

给定数据集DD和DD上的相似度函数dd以及正整数kk，如何求使得D(π)D(\pi)达到最大值的kk聚类π\pi？ 可以利用最小生成树的Kruskal算法解决这个问题。

/*Primq求MST耗费矩阵cost[][],标号从1开始，1~n返回最小生成树的权值，返回-1表示原图不连通*/#include<iostream>#include<cstring>#include<cstdio>using namespace std;const int INF=0x3f3f3f3f;const int MAXN=505;int cost[MAXN][MA

///Kruskal求MST#include<iostream>#include<cstdio>#include<cmath>#include<cstring>#include<vector>#include<string>#include<map>#include<set>#include<queue>#include<deque>#include<list>#includ