sdjzujxc-CSDN博客

原创并查集

Almost Union-FindI hope you know the beautiful Union-Find structure. In this problem, you're to implement something similar, but not identical.The data structure you need to write is also a coll

2013-04-22 11:50:30 572

原创 uva 10972 类似poj 3352

RevolC FaeLoNHopefully, you can remember Koorosh from one of the previous problems. Fortunately, Koorosh has solved Basm’s problem without your help! Now, he is a high-ranked advisor of Basm. As u

2013-04-22 11:44:07 646

原创 hdu 3861

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

2013-04-22 11:27:34 834 4

原创 uva 10600 最小与次小生成树

Problem AACM CONTEST AND BLACKOUT In order to prepare the “The First National ACM School Contest”(in 20??) the major of the city decided to provide all the schools with a reliable source of po

2013-04-09 11:20:34 927

原创 poj 2352

StarsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 25160 Accepted: 10983DescriptionAstronomers often examine star maps where stars are represented by po

2013-04-08 20:29:03 520

原创 Hdu 1166 敌兵布阵（基本树状数组的运用）

敌兵布阵Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 25174 Accepted Submission(s): 10883Problem DescriptionC国的死对头A国这段时间正在进行军事演习，所以

2013-04-08 19:40:21 531

原创 poj 2395

Out of HayTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 9114 Accepted: 3473DescriptionThe cows have run out of hay, a horrible event that must be remedi

2013-03-30 14:19:16 963

原创 poj 1861

NetworkTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 11156 Accepted: 4246 Special JudgeDescriptionAndrew is working as system administrator and is p

2013-03-27 14:28:39 841

原创 zoj 3204 字典序最小的最小生成树的输出

Connect themTime Limit: 1 Second Memory Limit: 32768 KBYou have n computers numbered from 1 to n and you want to connect them to make a small local area network (LAN). All connections are

2013-03-27 13:37:45 720

原创 zoj 3497

MistwaldTime Limit: 2 Seconds Memory Limit: 65536 KBIn chapter 4 of the game Trails in the Sky SC, Estelle Bright and her friends are crossing Mistwald to meet their final enemy, Lucciola

2013-03-26 10:39:22 1635 1

原创 poj 2337

CatenymsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 7869 Accepted: 2068DescriptionA catenym is a pair of words separated by a period such that the las

2013-03-23 19:13:23 664

原创 poj 1386

Play on WordsTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 7877 Accepted: 2778DescriptionSome of the secret doors contain a very interesting word puzzle

2013-03-21 15:52:02 1058

原创 poj 3509

Rotating RingsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 1707 Accepted: 650Description111111222112

2013-03-18 18:41:41 667

原创 hdu1013

Digital RootsTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 35452 Accepted Submission(s): 10849Problem DescriptionThe digita

2013-03-17 18:42:46 975

原创 poj 3510

A Tale from the Dark Side of the MoonTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 2623 Accepted: 742DescriptionUs: So why don’t you just recompile th

2013-03-17 17:15:40 657

原创 hdu 1497

Simple Library Management SystemTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1149 Accepted Submission(s): 333Problem Descrip

2013-03-17 17:08:02 1014

原创 SDUT 第九周周赛

Fermat’s Chirstmas Theorem Time Limit: 1000MS Memory limit: 65536K 题目描述In a letter dated December 25, 1640; the great mathematician Pierre de Fermat wrote to Marin Mersenne that he just pr

2013-03-16 17:37:23 678

原创 zoj 2975

Kinds of FuwasTime Limit: 2 Seconds Memory Limit: 65536 KB In the year 2008, the 29th Olympic Games will be held in Beijing. This will signify the prosperity of China as well as becomin

2013-03-16 09:40:53 840

原创 poj 1008

Maya CalendarTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 56887 Accepted: 17567DescriptionDuring his last sabbatical, professor M. A. Ya made a surpris

2013-03-12 21:23:49 635

原创 poj 2400 最小权匹配+匹配输出

Supervisor, SuperviseeTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 2055 Accepted: 581DescriptionSuppose some supervisors each get to hire a new person

2013-03-07 13:51:01 780

原创 poj 3660

Cow ContestTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 5695 Accepted: 3064DescriptionN (1 ≤ N ≤ 100) cows, conveniently numbered 1..N, are parti

2013-03-04 17:37:17 1020

原创 poj 1094

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

2013-03-04 16:24:10 958

原创 poj 2516

Minimum CostTime Limit: 4000MS Memory Limit: 65536KTotal Submissions: 11530 Accepted: 3892DescriptionDearboy, a goods victualer, now comes to a big problem, and he

2013-02-27 18:19:44 465

原创 hdu 1853

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

2013-02-27 09:12:08 303

原创 hdu 3488

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

2013-02-26 18:16:38 675

原创 hdu 2853

AssignmentTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 566 Accepted Submission(s): 290Problem DescriptionLast year a terrible

2013-02-26 16:31:35 551

原创山东省2012年省赛三道水题

The Best Seat in ACM Contest Time Limit: 1000MS Memory limit: 65536K 题目描述Cainiao is a university student who loves ACM contest very much. It is a festival for him once when he attends

2013-02-26 11:47:41 1189 1

原创 hdu 2255（KM算法模板）

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

2013-02-23 10:46:51 1919

原创重做 poj 2195（KM算法）

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

2013-02-22 18:55:11 408

原创 poj 3487

The Stable Marriage ProblemTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 1959 Accepted: 835DescriptionThe stable marriage problem consists of matching

2013-02-21 09:54:09 1500 2

原创 poj 3692 （二分图最大团）

KindergartenTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 4026 Accepted: 1933DescriptionIn a kindergarten, there are a lot of kids. All girls of the

2013-02-20 10:25:39 1623

转载二分匹配总结（匈牙利算法+最大权+最小权）

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

2013-02-20 10:17:51 821

原创 poj 1129 （类似poj 1419）

Channel AllocationTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 10332 Accepted: 5268DescriptionWhen a radio station is broadcasting over a very large ar

2013-02-19 17:58:13 408

原创 poj 1419 最大团

Graph ColoringTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 3346 Accepted: 1491 Special JudgeDescriptionYou are to write a program that tries to fin

2013-02-19 16:32:07 483

原创 poj 1523 割点分块

SPFTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 4088 Accepted: 1889DescriptionConsider the two networks shown below. Assuming that data moves around th

2013-02-19 16:27:52 503

原创 poj 3177

Redundant PathsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 6723 Accepted: 2924DescriptionIn order to get from one of the F (1 <= F <= 5,000) grazing f

2013-01-31 17:03:44 481

原创 poj 1144

NetworkTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 7272 Accepted: 3415DescriptionA Telephone Line Company (TLC) is establishing a new telephone cable

2013-01-30 11:46:07 359

原创 poj 3352 无向图

Road ConstructionTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 6503 Accepted: 3271DescriptionIt's almost summer time, and that means that it's almos

2013-01-29 15:25:17 538

转载求强连通分量的tarjan算法Gabow算法

求强连通分量的tarjan算法强连通分量：是有向图中的概念，在一个图的子图中，任意两个点相互可达，也就是存在互通的路径，那么这个子图就是强连通分量。（如果一个有向图的任意两个点相互可达，那么这个图就称为强连通图）。如果u是某个强连通分量的根，那么：（1）u不存在路径可以返回到它的祖先。（2）u的子树也不存在路径可以返回到u的祖先。· 例如：· 强连通分量。在一个非强连通图中

2013-01-28 15:36:40 1961

原创 poj 2186 tarjian与gabow算法

Popular CowsTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 18198 Accepted: 7330DescriptionEvery cow's dream is to become the most popular cow in the herd

2013-01-28 15:33:01 1279

二分图最大匹配及常用建图方法

空空如也