有礼貌的程序员

Antenna PlacementTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 5774 Accepted: 2884DescriptionThe Global Aerial Research Centre has been allotted the tas

Power NetworkTime Limit: 2000MS Memory Limit: 32768KTotal Submissions: 21178 Accepted: 11091DescriptionA power network consists of nodes (power stations, consumers

ACM Computer FactoryTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 4855 Accepted: 1657 Special JudgeDescriptionAs you know, all the computers used

Labeling BallsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 9385 Accepted: 2549DescriptionWindy has N balls of distinct weights from 1 unit to N uni

匈牙利算法是解决寻找二分图最大匹配的。(一)预备知识    什么是二分图：二分图又称作二部图，是图论中的一种特殊模型。 设G=(V,E)是一个无向图，如果顶点V可分割为两个互不相交的子集(A,B)，并且图中的每条边（i，j）所关联的两个顶点i和j分别属于这两个不同的顶点集(i in A,j in B)，则称图G为一个二分图。    什么是匹配：把上图想象成3男4女搞对象（无同性

Sorting It All OutTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 24933 Accepted: 8662DescriptionAn ascending sorted sequence of distinct values is one in

AsteroidsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 12937 Accepted: 7040DescriptionBessie wants to navigate her spaceship through a dangerous asteroi