G.D.Retop的专栏

MZL's CityTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 649    Accepted Submission(s): 225Problem DescriptionMZL is an active

3345.   Chinese ChessTime Limit: 20.0 Seconds   Memory Limit: 65536KTotal Runs: 426   Accepted Runs: 47Winnie is very interested in chinese chess. Now, let's consider a game which is s

Redraw Beautiful DrawingsTime Limit: 3000/1500 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 3760    Accepted Submission(s): 1118Problem Description

转自      http://www.cppblog.com/imky/articles/123427.html  一个无向连通网络，去掉一个边集可以使其变成两个连通分量则这个边集就是割集；最小割集当然就权和最小的割集。可以用最小切割最大流定理：1.min=MAXINT,确定一个源点2.枚举汇点3.计算最大流，并确定当前源汇的最小割集，若比min小更新min4.转到2直

题目：给一个图，起点1，终点n必须走最短路才能从起点到终点。问至少删除几条边使得无法从起点到终点。且删除最多几条边，还可以从起点到终点。分析：做最短路，所有满足dist[u] = dist[v] + w(v,u)的边都是最短路的边，对这样的边，重新建图。新图加入e(u,v)，边权为1t到s作最短路d，就是最少需要的边数能够到达边数，总边数-d就是最多能删除的边对

Hawk-and-ChickenTime Limit: 6000/2000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2326    Accepted Submission(s): 684Problem DescriptionKids in ki

Object ClusteringTime Limit: 2000MS Memory Limit: 131072KTotal Submissions: 1732 Accepted: 432DescriptionWe have N (N ≤ 10000) objects, and wish to classify the

现成的东西，就不自己写了。转载请注明出处，谢谢http://blog.youkuaiyun.com/ACM_cxlove?viewmode=contents    by---cxlove二维平面中有一些点，两点之间的距离为曼哈顿距离，求最小生成树。朴素的n个点，只能做到O(n^3)或者O(n^2 lgn)。但是针对这种曼哈顿距离的MST。其中有个性质是：对于某个点，以他为中心的区域分为8个象限，对

CRB and AppleTime Limit: 12000/6000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 336    Accepted Submission(s): 101Problem DescriptionIn Codeland t

2055. Urban GeographyTime limit: 2.0 secondMemory limit: 128 MBAndroid Vasya prepares a project in Urban geography. The aim of the project is to improve the infrasructure of the city he

#include#includeusing namespace std;int map[1000][1000];int nn,n;void in(){ cin>>map[nn/n][nn%n]; nn++;}void out();void xun1();void xun2();void xun3();void xun4();int ans = 0;voi

In TouchTime Limit: 8000/4000 MS (Java/Others)    Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 67    Accepted Submission(s): 11Problem DescriptionThere are n soda li

3294.   Building BlockTime Limit: 1.0 Seconds Memory Limit: 65536KTotal Runs: 840   Accepted Runs:235John are playing with blocks. There are N blocks (1 ≤ N ≤ 30000) numbered 0..N-