cstdlib

hdu 1301(最小生成树kruskal)

最小生成树(kruskal) Author: Try_86 Date: 10/04/12 19:51 */ #include <cstdio> #include <cstdlib
·2015-11-11 05:36

hdu 1875(最小生成树kruskal)

不符合题意所述的距离不加进边集中，然后套用kruskal就可以了 */ #include <cmath> #include <cstdio> #include <cstdlib
·2015-11-11 05:35

hdu 1879(最小生成树kruskal)

(kruskal) * 本题要点：当两点之间已有路时，把这两点的路长设为0，然后就是套用kruskal了 */ #include <cstdio> #include <cstdlib
·2015-11-11 05:34

hdu 1233(最小生成树kruskal)

/* * 最小生成树练手题，采用kruskal求解 */ #include <cstdio> #include <cstdlib> #include <cstring
·2015-11-11 05:33

hdu 1009(贪心)

//贪心，比例从大往后贪#include <cstdio>#include <cstdlib>#include <iostream>using namespace std
·2015-11-11 05:12

poj3670

O(n)的dp View Code #include <iostream> #include <cstdio> #include <cstdlib>
·2015-11-11 04:33

poj1286

View Code #include <iostream> #include <cstdio> #include <cstdlib> #include &
·2015-11-11 04:31

poj3668

简单题 View Code #include <iostream> #include <cstdio> #include <cstdlib> #include
·2015-11-11 04:29

poj2250

dp，最长公共子序列变形 View Code #include <iostream> #include <cstdio> #include <cstdlib
·2015-11-11 04:28

poj3221

bfs View Code #include <iostream>#include <cstdlib>#include <cstring>#include
·2015-11-11 04:27

poj3385

简单题 View Code #include <iostream>#include <cstdlib>#include <cstring>#include
·2015-11-11 04:26

poj3390

dp View Code #include <iostream>#include <cstdlib>#include <cstring>#include
·2015-11-11 04:25

poj3497

二分+排序 View Code #include <iostream>#include <cstdlib>#include <cstring>#include
·2015-11-11 04:24

poj3767

最短路 View Code #include <iostream>#include <cstdlib>#include <cstring>#include
·2015-11-11 04:23

poj3646

简单题 View Code #include <iostream>#include <cstdlib>#include <cstring>#include
·2015-11-11 04:23

poj3249

记忆化搜索 View Code #include <iostream>#include <cstdlib>#include <cstring>#include
·2015-11-11 04:21

poj3230

dp View Code #include <iostream>#include <cstdlib>#include <cstring>#include
·2015-11-11 04:21

poj3194

简单题， BFS View Code #include <iostream>#include <cstdlib>#include <cstring>#include
·2015-11-11 04:20

poj3036

记忆化搜索 View Code #include <iostream>#include <cstdlib>#include <cstring>#include
·2015-11-11 04:19

poj1157

< iostream > #include < cstdio > #include < cstdlib
·2015-11-11 04:18

poj1113

凸包周长＋半径为l的圆周长 View Code #include < iostream > #include < cstdio > #include < cstdlib
·2015-11-11 04:17

poj1258

< iostream > #include < cstdio > #include < cstdlib
·2015-11-11 04:16

poj1256

< iostream > #include < cstdio > #include < cstdlib
·2015-11-11 04:15

poj1350

< iostream > #include < cstdio > #include < cstdlib
·2015-11-11 04:13

poj1338

< iostream > #include < cstdio > #include < cstdlib
·2015-11-11 04:12

poj1331

< iostream > #include < cstdio > #include < cstdlib
·2015-11-11 04:11

poj1330

< iostream > #include < cstdio > #include < cstdlib
·2015-11-11 04:10

poj1325

< iostream > #include < cstdio > #include < cstdlib
·2015-11-11 04:10

poj1318

< iostream > #include < cstdio > #include < cstdlib
·2015-11-11 04:08

poj1321

< iostream > #include < cstdio > #include < cstdlib
·2015-11-11 04:08

poj1308

< iostream > #include < cstdio > #include < cstdlib
·2015-11-11 04:07

poj1306

< iostream > #include < cstdio > #include < cstdlib
·2015-11-11 04:06

poj1488

< iostream > #include < cstdio > #include < cstdlib
·2015-11-11 04:05

UVA 11461 - Square Numbers(水题)

3 #include <string> 4 #include <cmath> 5 #include <ctime> 6 #include <cstdlib
·2015-11-11 04:54

POJ 2402 Palindrome Numbers

3 #include <string> 4 #include <cmath> 5 #include <ctime> 6 #include <cstdlib
·2015-11-11 04:52

UVA 11489 - Integer Game(找规律)

3 #include <string> 4 #include <cmath> 5 #include <ctime> 6 #include <cstdlib
·2015-11-11 04:51

UVA 10892 - LCM Cardinality(数学题)

3 #include <string> 4 #include <cmath> 5 #include <ctime> 6 #include <cstdlib
·2015-11-11 04:50

UVA 10780 - Again Prime? No Time.

3 #include <string> 4 #include <cmath> 5 #include <ctime> 6 #include <cstdlib
·2015-11-11 04:49

POJ 2420 A Star not a Tree?(模拟退火)

3 #include <string> 4 #include <cmath> 5 #include <ctime> 6 #include <cstdlib
·2015-11-11 04:48

POJ 1244 Slots of Fun(计算几何)

#include <iostream> 2 #include <cstring> 3 #include <cstdio> 4 #include <cstdlib
·2015-11-11 04:37

POJ 1127 Jack Straws(计算几何)

#include <iostream> 2 #include <cstring> 3 #include <cstdio> 4 #include <cstdlib
·2015-11-11 04:36

POJ 1106 Transmitters(计算几何)

#include <iostream> 2 #include <cstring> 3 #include <cstdio> 4 #include <cstdlib
·2015-11-11 04:35

HDU 4738 Caocao's Bridges(Tarjan)

#include <cstring> 3 #include <cstdio> 4 #include <queue> 5 #include <cstdlib
·2015-11-11 04:22

HDU 4741 Save Labman No.004(计算几何)

include <iostream> 2 #include <cstring> 3 #include <cstdio> 4 #include <cstdlib
·2015-11-11 04:20

bjfu1287字符串输出的大水题

不多说 /* * Author : ben */ #include <cstdio> #include <cstdlib> #include <cstring
·2015-11-11 04:06

bjfu1281

/* * Author : ben */ #include <cstdio> #include <cstdlib> #include <cstring&
·2015-11-11 04:05

hdu4561 bjfu1270 最大子段积

直接上代码： /* * Author : ben */ #include <cstdio> #include <cstdlib> #include <
·2015-11-11 04:03

bjfu1253 最大上升子序列和

直接上代码 /* * Author : ben */ #include <cstdio> #include <cstdlib> #include <
·2015-11-11 04:03

hdu1896 bjfu1268 水题

不多说，上代码(这是bjfuoj的，hdu的要稍改一下)： /* * Author : ben */ #include <cstdio> #include <cstdlib
·2015-11-11 04:02

hdu1998 bjfu1272奇数阶幻方构造

/* * Author : ben */ #include <cstdio> #include <cstdlib> #include <cstring&
·2015-11-11 04:01
上一页 17 18 19 20 21 22 23 24 下一页
按字母分类： ABCDEFGHIJKLMNOPQRSTUVWXYZ其他