cstdio

POJ 3978

View Code 1 #include<cstdio> 2 #include<cstring> 3 #include<algorithm> 4
·2015-11-13 06:47

POJ 3332

View Code 1 #include<cstdio> 2 #include<cstring> 3 #include<algorithm> 4
·2015-11-13 06:46

POJ 1406

View Code 1 #include<cstdio> 2 #include<algorithm> 3 #include<cstring> 4
·2015-11-13 06:45

POJ 2810

View Code 1 #include<cstdio> 2 #include<cstring> 3 #include&
·2015-11-13 06:43

POJ 2379

View Code 1 #include<cstdio> 2 #include<cstring> 3 #include<algorithm> 4
·2015-11-13 06:42

POJ 1156

View Code #include<cstdio> #include<cstring> #include<algorithm>
·2015-11-13 06:41

POJ 2059

View Code 1 #include<cstdio> 2 #include<cstring> 3 #include<algorithm> 4
·2015-11-13 06:40

POJ 2034

题解：dfs+剪枝即可 View Code 1 #include<cstdio> 2 #include<cstring> 3 #include<algorithm
·2015-11-13 06:39

POJ 2460

View Code 1 #include<cstdio> 2 #include<cstring> 3 #include<algorithm> 4
·2015-11-13 06:36

POJ 2329

题解：bfs每个0 View Code 1 #include<cstdio> 2 #include<cstring> 3 #include<algorithm
·2015-11-13 06:36

POJ 3272

View Code 1 #include<cstdio> 2 #include<cst
·2015-11-13 06:32

POJ 3279

View Code 1 #include<cstdio> 2 #include<algorithm> 3 #include<cstring> 4
·2015-11-13 06:31

POJ 1252

View Code 1 #include<cstdio> 2 #include<cstri
·2015-11-13 06:30

POJ 1240

View Code 1 #include<cstdio>
·2015-11-13 06:29

POJ 2887

View Code 1 #include<cstdio> 2 #include<cstring> 3 #include<cmath> 4 #include
·2015-11-13 06:28

POJ 1509

View Code 1 #include<cstdio> 2 #include<string> 3 #include<algorith
·2015-11-13 06:27

POJ 2955

的最大匹配，dp[i][j]=max(dp[i+1][j-1]+corr(s[i],s[j]),dp[i][k]+dp[k+1][j]); View Code 1 #include<cstdio
·2015-11-13 06:26

POJ 1686

View Code 1 #include<cstdio> 2 #include<cstring> 3 #include<algorithm>
·2015-11-13 06:25

POJ 2812

View Code 1 #include<cstdlib> 2 #include<cmath> 3 #include<cstdio> 4 #include
·2015-11-13 06:24

POJ 1155

为根的子树含有j个叶子结点时最大权值，对每一个i的子树，dp[i][j]=max(dp[i][j],dp[i][j-k]+dp[t][k]-c) View Code 1 #include<cstdio
·2015-11-13 06:22

POJ 2556

题解：同上 View Code 1 #include<cstdio> 2 #include<cstring> 3 using namespace std;
·2015-11-13 06:21

POJ 3705

View Code 1 #include<cstdio
·2015-11-13 06:20

POJ 3138

View Code 1 #include<cstdio> 2 #include<cstring> 3 #include<algorithm> 4
·2015-11-13 06:18

POJ 1734

枚举点k的两端是否形成回路，如果形成，必定是没有经过重复点的，因为那样就不是最小距离，而经过点k的弧的松弛操作还没进行，所以也不会经过k View Code 1 #include<cstdio
·2015-11-13 06:16

POJ 3505

View Code 1 #include<cstdio> 2 #include<cstring> 3 #include<algorithm> 4
·2015-11-13 06:16

POJ 1365

View Code 1 #include<cstdio> 2 #include<cstring> 3 #include<algorithm> 4
·2015-11-13 06:15

POJ 1486

View Code 1 #include<cstdio> 2 #include<cstri
·2015-11-13 06:14

POJ 1675

View Code 1 #include<cstdio> 2 #includ
·2015-11-13 06:13

POJ 2139

题解：flyod最短路，枚举找最小 View Code 1 #include<cstdio> 2 #include<algorithm> 3 #include
·2015-11-13 06:10

POJ 2526

题解：排序，验证 View Code 1 #include<cstdio> 2 #include<cstring> 3 #include<algorithm
·2015-11-13 06:10

POJ 3275

View Code 1 #include<cstdio> 2 #incl
·2015-11-13 06:09

POJ 3050

题意：问从5*5的矩阵中选连续的6个组成的字符串有多少种 题解：dfs View Code 1 #include<cstdio> 2 #include<cstring
·2015-11-13 06:08

POJ 1254

View Code 1 #include<cstdlib> 2 #include<cmath> 3 #include<cstdio> 4 #include
·2015-11-13 06:06

POJ 1976

View Code 1 #include<cstdio> 2 #include<cstring> 3 #include<algorithm> 4
·2015-11-13 06:04

POJ 2442

View Code 1 #include<cstdio> 2 #include<cstring> 3 #include<algorithm> 4
·2015-11-13 06:02

HDOJ 4276

View Code 1 #include<cstdio> 2 #include<cstring> 3 #include<algorithm>
·2015-11-13 06:01

POJ 2688

找一条哈密顿路，爆搜完事 #include<cstdio> #include<cstring> #include<algorithm> #include<
·2015-11-13 06:00

POJ 2565

#include<cstdio> #include<cstring> #include<algorithm> using namespace std; const
·2015-11-13 06:58

POJ 1270

#include<cstdio> #include<cstring> #include<cctype> using namespace std; int d[
·2015-11-13 06:57

POJ 1690

#include<cstdio> #include<cstring> using namespace std; int main() { int T;
·2015-11-13 06:57

POJ 2082

感觉在玩文字狱TOT #include<cstdio> #include<algorithm> #include<cstring> using namespace
·2015-11-13 06:56

POJ 1695

View Code 1 #include<cstdio> 2 #include<cstring> 3 #include&l
·2015-11-13 06:55

POJ 2584

裸的最大流 View Code 1 #include<cstdio> 2 #include<cstring> 3 #include<algorithm
·2015-11-13 06:55

POJ 2225

三维最短路 View Code 1 #include<cstdio> 2 #include<cstring> 3 #include<queue>
·2015-11-13 06:54

POJ 3044

View Code 1 #include<cstdio> 2 #include<cstring> 3 #include<algorithm> 4
·2015-11-13 06:53

POJ 2437

View Code 1 #include<cstdio> 2 #include<cstring> 3 #include<algorithm> 4
·2015-11-13 06:52

POJ 3450

View Code 1 #include<cstdio> 2 #include<algorithm> 3 #include<cstring> 4
·2015-11-13 06:52

POJ 2110

O（n^3log(n)）47MS水过，枚举高度差log(n)，枚举最低高度n，dfs一遍n^2 View Code 1 #include<cstdio> 2 #include
·2015-11-13 06:51

POJ 3436

View Code 1 #include<cstdio> 2 #include<cstring> 3 #include<al
·2015-11-13 06:50

POJ 2960

利用SG函数特性，和的SG函数等于单独SG函数的异或，然后对预处理SG函数 View Code 1 #include<cstdio> 2 #include<cstring
·2015-11-13 06:50
上一页 18 19 20 21 22 23 24 25 下一页
按字母分类： ABCDEFGHIJKLMNOPQRSTUVWXYZ其他