sdjzujxc的专栏

The Stable Marriage Problem Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 1959   Accepted: 835 Description The stable marriage problem consists of matching

Minimum Cost Time Limit: 4000MS   Memory Limit: 65536K Total Submissions: 11530   Accepted: 3892 Description Dearboy, a goods victualer, now comes to a big problem, and he

Tour Time Limit: 3000/1000 MS (Java/Others)    Memory Limit: 65535/65535 K (Java/Others) Total Submission(s): 1148    Accepted Submission(s): 605 Problem Description In the kingdom of Henryy,

Cyclic Tour Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/65535 K (Java/Others) Total Submission(s): 861    Accepted Submission(s): 438 Problem Description There are N cities i

Assignment Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 566    Accepted Submission(s): 290 Problem Description Last year a terrible

//KM算法求解最小权，二分最优匹配 #include #include #include #include #include using namespace std; #define INF 99999999 #define maxn 105 char str[maxn][maxn];//存输入的字符数组 int lx[maxn],ly[maxn];//顶标 int x

Supervisor, Supervisee Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 2055   Accepted: 581 Description Suppose some supervisors each get to hire a new person

奔小康赚大钱 Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 1531    Accepted Submission(s): 669 Problem Description 传说在遥远的地方有一个非常富裕的村落,有一天,村

二分匹配总结（匈牙利算法+最大权+最小权）   前段时间为了省赛，我专门花了半个月来“专研”二部图，目前对二部图还是有一点点心得，所以就记录下来，希望对某些人有用。   开始我对二部图一窍不通，于是就在网上找资料，认真看完了各种资料，有一种感触：关于最大匹配问题，网上写的是挺好的，有深搜和广搜算法，很精辟；但是关于加权二部图，网上只有思想，没有具体实现代码，如果让一

Kindergarten Time Limit: 2000MS   Memory Limit: 65536K Total Submissions: 4026   Accepted: 1933 Description In a kindergarten, there are a lot of kids. All girls of the

The King’s Problem Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 1091    Accepted Submission(s): 404 Problem Description   In the