cstdio

poj2031

简单题 View Code #include < iostream > #include < cstdio
·2015-11-11 15:36

poj1905

View Code #include < iostream > #include < cstdio > #include < cstdlib &g
·2015-11-11 15:34

HDOJ1016(标准dfs)

标准DFS模板： #include <iostream> #include <cstdio> #include <cstring> using namespace
·2015-11-11 15:09

[poj 1144]Network[Tarjan求割点]

这样的输入还是要保证以数字读入吧...gets没前途的 思路: 割点的模板啦~   #include <cstdio> #include <cstring>
·2015-11-11 15:03

POJ 1273(ISAP+邻接表)

//题目类型：纯最大流 //算法实现：ISAP算法（邻接表实现） #include<iostream> #include<cstdio> //#include<conio.h
·2015-11-11 15:53

[poj][3167][Cow Patterns]

View Code #include <cstdio> #include <cstring> #include <vector> using namespa
·2015-11-11 15:08

[poj][2493][Rdeaalbe][map方法]

id=2493 View Code #include <iostream> #include <sstream> #include <cstdio>
·2015-11-11 15:07

[poj][3261][Milk Patterns]

View Code #include <cstdio> #include <cstring> #include <map> using namespace
·2015-11-11 15:06

[poj][3580][SuperMemo]

id=3580 View Code #include <iostream> #include <cstdio> #include <cstring>
·2015-11-11 15:05

[poj][2600][Geometrical dreams]

View Code #include <cstdio> #include <cmath> #include <algorithm> #define dis
·2015-11-11 15:05

[poj][3285][Point of view in Flatland]

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

[poj][3301][Texas Trip]

id=3301 View Code #include <cstdio> #include <cmath> #include <cstring> #include
·2015-11-11 15:03

[poj][2187][Beauty Contest]

id=2187 View Code #include <iostream> #include <cstdio> #include <math.h>
·2015-11-11 15:02

POJ 2886 Who Gets the Most Candies?(树状数组+二分)

1 #include <cstring> 2 #include <cstdio> 3 #include <string> 4 #include <
·2015-11-11 15:11

POJ 2492 A Bug's Life(并查集)

1 #include <cstring> 2 #include <cstdio> 3 #include <string> 4 #include <iostream
·2015-11-11 15:11

POJ 1182 食物链(并查集）

tx] = X; 那么X + flag[x]  = flag[y] + 2 （当x吃y的时候） 1 #include <cstring> 2 #include <cstdio
·2015-11-11 15:10

POJ 1703 Find them, Catch them(种类并查集)

1 #include <cstring> 2 #include <cstdio> 3 #include <string> 4 #include <iostream
·2015-11-11 15:09

HDU 4133 StrangeStandard(反素数模版)

1 #include <cstdio> 2 #include <cstring> 3 #include <algorithm> 4 using namespace
·2015-11-11 15:08

TC SRM 582 DIV 2

1 #include <cstring> 2 #include <cstdio> 3 #include <string> 4 #include <iostream
·2015-11-11 15:08

POJ 2528 Mayor's posters(线段树)

1 #include <cstdio> 2 #include <cstring> 3 #include <algorithm> 4 using namespace
·2015-11-11 15:07

HDU 4267 A Simple Problem with Integers(树状数组)

1 #include <cstdio> 2 #include <cstring> 3 #include <cmath> 4 #include <algorithm
·2015-11-11 15:05

HDU 3874 Necklace(离线算法+树状数组)

1 #include <cstdio> 2 #include <cstring> 3 #include <cmath> 4 #incl
·2015-11-11 15:04

Vijos 1617 超级教主(单调队列DP)

  1 #include <cstdio> 2 #include <cstring> 3 #include <iostream> 4 using
·2015-11-11 15:03

Vijos 1196 吃糖果游戏（博弈论)

1 #include <cstdio> 2 #include <cstring> 3 #include <iostream> 4 using namespace
·2015-11-11 15:03

HDU 1848 Fibonacci again and again(SG函数)

1 #include <cstdio> 2 #include <cstring> 3 #include <iostream> 4 using namespace
·2015-11-11 15:02

HDU 1850 Being a Good Boy in Spring Festival(sg函数)

1 #include <iostream> 2 #include <cstdio> 3 #include <cstring> 4 #include <
·2015-11-11 15:01

HDU 1536 S-Nim(博弈论)

  1 #include <iostream> 2 #include <cstdio> 3 #include <cstring> 4 #include
·2015-11-11 15:00

USACO 5.4 All Latin Squares(DFS)

1 /* 2 ID: cuizhe 3 LANG: C++ 4 TASK: latin 5 */ 6 #include <cstdio> 7 #include <
·2015-11-11 15:59

USACO 5.3 Network of Schools(Tarjan)

TASK: schlnet 5 */ 6 #include <iostream> 7 #include <cstring> 8 #include <cstdio
·2015-11-11 15:58

USACO 5.3 Big Barn(DP）

4 TASK: bigbrn 5 */ 6 #include <iostream> 7 #include <cstring> 8 #include <cstdio
·2015-11-11 15:58

USACO 5.3 Window Area(模拟)

ID: cuizhe 3 LANG: C++ 4 TASK: window 5 */ 6 #include <iostream> 7 #include <cstdio
·2015-11-11 15:57

USACO 5.2 Wisconsin Squares(DFS)

cuizhe 3 LANG: C++ 4 TASK: wissqu 5 */ 6 #include <iostream> 7 #include <cstdio
·2015-11-11 15:56

HDU 4562 守护雅典娜（DAG上的最长路）

1 #include <iostream> 2 #include <cstdio> 3 #include <cstring> 4 #include
·2015-11-11 15:56

UPC 2195 Temple Build（DP）

搞了一下午，枚举顺序要注意....然后数据类型.... 1 #include <iostream> 2 #include <cstdio> 3 #include &
·2015-11-11 15:54

UPC 2188 Balls(DP)

1 #include <iostream> 2 #include <cstdio> 3 #include <cstring> 4 #include <
·2015-11-11 15:53

USACO 5.2 Snail Trails(DFS)

2 ID: cuizhe 3 LANG: C++ 4 TASK: snail 5 */ 6 #include <iostream> 7 #include <cstdio
·2015-11-11 15:51

USACO 5.1 Fencing the Cows(凸包)

1 /* 2 ID:cuizhe 3 LANG: C++ 4 TASK: fc 5 */ 6 #include <cstdio> 7 #include <cstring
·2015-11-11 15:50

USACO 4.4 Frame Up(拓扑排序)

1 /* 2 ID:cuizhe 3 LANG: C++ 4 TASK: frameup 5 */ 6 #include <cstdio> 7 #include
·2015-11-11 15:49

HDU 4526 威威猫系列故事——拼车记(DP)

1 #include <cstdio> 2 #include <cstring> 3 #include <queue> 4 #include <map
·2015-11-11 15:48

USACO 4.4 Pollutant Control

1 /* 2 ID:cuizhe 3 LANG: C++ 4 TASK: milk6 5 */ 6 #include <cstdio> 7 #include
·2015-11-11 15:48

HDU 4292 Food(dinic +拆点)

1 #include <cstdio> 2 #include <cstring> 3 #include <queue> 4 #include <
·2015-11-11 15:47

POJ 1151 Atlantis(离散化+暴力)

1 #include <cstdio> 2 #include <cstring> 3 #include <cmath> 4 #include <algorithm
·2015-11-11 15:46

HDU 4396 More lumber is required(二维SPFA)

1 #include <cstdio> 2 #include <cstring> 3 #include <queue> 4 using namespace
·2015-11-11 15:46

HDU 2896 病毒侵袭(AC自动机)

1 #include <cstdio> 2 #include <cstring> 3 #include <algorithm> 4 using namespace
·2015-11-11 15:45

POJ 2778 DNA Sequence(AC自动机+DP)

1 #include<iostream> 2 #include<cstdio> 3 #include<cstring> 4 #include<
·2015-11-11 15:44

HDU 2222 Keywords Search(AC自动机模版)

1 #include<iostream> 2 #include<cstdio> 3 #include<cstring> 4 #include<
·2015-11-11 15:43

POJ 3368 Frequent values(rmq)

#include <iostream> 2 #include <cstring> 3 #include <cmath> 4 #include <cstdio
·2015-11-11 15:43

POJ 3264 Balanced Lineup(RMQ模版)

#include <iostream> 2 #include <cstring> 3 #include <cmath> 4 #include <cstdio
·2015-11-11 15:42

HDU 2255 奔小康赚大钱(KM算法)

#include <iostream> 2 #include <cstring> 3 #include <string> 4 #include <cstdio
·2015-11-11 15:41

POJ 3308 Paratroopers(最小点权覆盖+dinic算法)

1 #include <cstdio> 2 #include <cstring> 3 #include <cmath> 4 #include <
·2015-11-11 15:40
上一页 70 71 72 73 74 75 76 77 下一页
按字母分类： ABCDEFGHIJKLMNOPQRSTUVWXYZ其他