二分图常见建边方法

二分图的建图方法

2016-02-19 20:56:57

阅读数 815

评论数 0

hdu5607graph

graph      Time Limit: 8000/4000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others) 问题描述 在一个NN个点(标号11~nn),MM条边的有向图上,一开始我在点u...

2016-02-22 22:26:15

阅读数 326

评论数 0

hdu5606tree

tree  Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others) 问题描述 有一个树(nn个点, n-1n−1条边的联通图),点标号从11~nn,树的边权是0...

2016-02-22 22:19:20

阅读数 208

评论数 0

hdu5605geometry

geometry  Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others) 问题描述 在平面直角坐标系上有一个点PP, 他的坐标是(x, y)(x,y). 有一...

2016-02-22 21:34:50

阅读数 279

评论数 0

hdu1045Fire Net

Fire Net Time Limit : 2000/1000ms (Java/Other)   Memory Limit : 65536/32768K (Java/Other) Problem Description Suppose that we have a s...

2016-02-19 21:13:58

阅读数 217

评论数 0

hdu1507Uncle Tom's Inherited Land*

Uncle Tom's Inherited Land* Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 2864    Accept...

2016-02-19 21:11:47

阅读数 192

评论数 0

hdu1298T9

T9 Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Problem Description A while ago it was quite cumber...

2016-02-15 12:35:11

阅读数 233

评论数 0

hdu2846Repository

Repository Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others) Problem Description When you go shopping, you can ...

2016-02-15 11:30:06

阅读数 216

评论数 0

hdu3460Ancient Printer

Ancient Printer Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 131072/65536 K (Java/Others) Problem Description The contest is beginning! ...

2016-02-15 10:06:13

阅读数 534

评论数 0

poj1419 Graph Coloring

Graph Coloring Time Limit: 1000MS   Memory Limit: 10000K           Description You are to write a program that trie...

2016-02-14 16:32:46

阅读数 205

评论数 0

hdu3585 maximum shortest distance

maximum shortest distance Problem Description There are n points in the plane. Your task is to pick k points (k>=2), and make the closest ...

2016-02-14 16:27:26

阅读数 586

评论数 0

hdu1530 Maximum Clique

Maximum Clique Problem Description Given a graph G(V, E), a clique is a sub-graph g(v, e), so that for all vertex pairs v1, v2 in v, there ex...

2016-02-14 16:18:48

阅读数 640

评论数 0

Codeforces Round #341 (Div. 2)D. Rat Kwesh and Cheese

D. Rat Kwesh and Cheese time limit per test2 seconds memory limit per test256 megabytes inputstandard input outputstandard output Wet Shark aske...

2016-02-05 12:00:00

阅读数 286

评论数 0

二进制 快速count 1

转载:http://www.cnblogs.com/grenet/archive/2011/06/10/2077228.html http://www.cppblog.com/zenliang/articles/131761.html  原题:一个正整数,转成二进制...

2016-02-04 18:50:20

阅读数 219

评论数 0

zoj3777Problem Arrangement(状态dp或者折半搜素)

Problem Arrangement Time Limit: 2 Seconds      Memory Limit: 65536 KB The 11th Zhejiang Provincial Collegiate Programming Contest is coming! As a p...

2016-02-04 17:15:41

阅读数 619

评论数 0

Codeforces Round #341 (Div. 2)C. Wet Shark and Flowers

C. Wet Shark and Flowers time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard outpu...

2016-02-02 18:05:21

阅读数 220

评论数 0

Codeforces Round #341 (Div. 2) B. Wet Shark and Bishops

B. Wet Shark and Bishops time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard outpu...

2016-02-02 17:18:02

阅读数 269

评论数 0

hdu5618 Jam's problem again(cdq分治)(BestCoder Round #70)

Jam's problem again  Time Limit: 5000/2500 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others) 问题描述 Jam喜欢坐标轴上的题,现在给出你一个三维的坐标轴,...

2016-02-02 11:28:40

阅读数 1065

评论数 0

hdu 5617 Jam's maze(dp)(BestCoder Round #70)

Jam's maze  Time Limit: 3000/1500 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others) 问题描述 Jam走进了一个迷宫,他要想走出这个迷宫,必须找到一条路径,使得这条路...

2016-02-02 11:22:18

阅读数 431

评论数 0

hdu5616Jam's balance(01背包或者折半搜素)(BestCoder Round #70 )

Jam's balance  Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others) 问题描述 Jam有NN个砝码和一个没有游标的天平,现在给他(1 \le...

2016-02-02 11:02:34

阅读数 584

评论数 0

提示
确定要删除当前文章?
取消 删除
关闭
关闭