cstdio

CDOJ 631 敢说敢做 记忆化搜索and动规

//跟沈爷学的 传送门http://www.cnblogs.com/Xiper/p/4639636.html 1 #include<cstdio> 2 #include<
·2015-11-11 07:18

8

#include <iostream>#include <cstdio>#include <algorithm>#include <cmath>#include
·2015-11-11 07:14

［转］关于Linux 静态库和动态库

Linux下创建静态、动态库 源码 -----------a.cpp---------------#include <cstdio>int a(int i){   
·2015-11-11 07:40

最大流增广路(KM算法) HDOJ 1853 Cyclic Tour

  题目传送门 1 /* 2 KM： 相比HDOJ_1533，多了重边的处理，还有完美匹配的判定方法 3 */ 4 #include <cstdio> 5 #include
·2015-11-11 07:39

最大流增广路(KM算法) HDOJ 1533 Going Home

  题目传送门 1 /* 2 最小费用流：KM算法是求最大流，只要w = -w就可以了，很经典的方法 3 */ 4 #include <cstdio> 5 #include
·2015-11-11 07:38

BFS Codeforces Beta Round #94 (Div. 2 Only) C. Statues

因为雕像最多8步就会全部下落， 3 只要撑过这个时间就能win，否则lose 4 */ 5 #include <cstdio> 6 #include <algorithm>
·2015-11-11 07:37

构造 Codeforces Round #135 (Div. 2) B. Special Offer! Super Price 999 Bourles!

3 另外，最多len-1次循环 4 */ 5 #include <cstdio> 6 #include <algorithm> 7 #include <cstring
·2015-11-11 07:36

贪心 Codeforces Round #135 (Div. 2) C. Color Stripe

2时，结果肯定是ABABAB或BABABA，取最小改变量；当m > 2时，当与前一个相等时， 改变一个字母 3 同时不和下一个相等就是最优的解法 4 */ 5 #include <cstdio
·2015-11-11 07:35

最短路 Codeforces Round #103 (Div. 2) D. Missile Silos

还要扫描点；点有两种情况，一种刚好在中点，即从u，v都一样，那么最后/2 3 还有一种是从u，v不一样，两种的距离都是l 4 模板错了，逗了好久:( 5 */ 6 #include <cstdio
·2015-11-11 07:35

枚举 UVA 11464 Even Parity

3 枚举：枚举第一行的所有可能(1<<n)，下一行完全能够由上一行递推出来，b数组保存该位置需要填什么 4 最后检查不同的数量，取最小值 5 */ 6 #include <cstdio
·2015-11-11 07:34

贪心 UVA 11729 Commando War

  题目传送门 1 /* 2 贪心：按照执行时间长的优先来排序 3 */ 4 #include <cstdio> 5 #include <algorithm
·2015-11-11 07:33

二分图判定+点染色/并查集 BestCoder Round #48 ($) 1002 wyh2000 and pupil

每一次二分图匹配时，将点多的集合加大最后第一个集合去 4 注意：n <= 1，no，两个集合都至少有一人；ans == n，扔一个给另一个集合 5 */ 6 #include <cstdio
·2015-11-11 07:32

数学 Codeforces Round #219 (Div. 2) B. Making Sequences is Fun

1 /* 2 数学：这题一直WA在13组上，看了数据才知道是计算cost时超long long了 3 另外不足一个区间的直接计算个数就可以了 4 */ 5 #include <cstdio
·2015-11-11 07:30

贪心 Codeforces Round #191 (Div. 2) A. Flipping Game

  题目传送门 1 /* 2 贪心：暴力贪心水水 3 */ 4 #include <cstdio> 5 #include <algorithm> 6
·2015-11-11 07:30

DP Codeforces Round #FF (Div. 1) A. DZY Loves Sequences

i+1]，可以改a[i]，那么值为l[i-1] + r[i+1] + 1 4 2. l[i-1] + 1 3. r[i+1] + 1 //修改a[i] 5 */ 6 #include <cstdio
·2015-11-11 07:29

递推 Codeforces Round #186 (Div. 2) B. Ilya and Queries

  题目传送门 1 /* 2 递推：用cnt记录前缀值，查询区间时，两个区间相减 3 */ 4 #include <cstdio> 5 #include <
·2015-11-11 07:28

递推DP Codeforces Round #260 (Div. 1) A. Boredom

  题目传送门 1 /* 2 DP：从1到最大值，dp[i][1/0] 选或不选，递推更新最大值 3 */ 4 #include <cstdio> 5 #include
·2015-11-11 07:27

[简单DP] COJ 1122 Game

# include <cstdio> # include <cstring> # define N 1000 + 5 int n, m; int cnt[N]
·2015-11-11 07:46

[拓扑排序] PKU 2585 Window Pains

# include <cstdio> # include <cst
·2015-11-11 07:45

[状态压缩DP] PKU 3311 Hie with the Pie

# include <cstdio> # include <cstring> # define INF 0x3C3C3C3C # define N 10 + 2
·2015-11-11 07:44

[简单DP] HDOJ 4323 Magic Number

编辑距离的方法可以水过这道题 编辑距离的计算方法即一个不完全的证明见：http://en.wikipedia.org/wiki/Levenshtein_distance 具体如下图： # include <cstdio
·2015-11-11 07:43

[字典树入门] HDOJ 1251 统计难题

# include <cstdio> # include <cstring> # define LEN 10 + 1 struct node { int
·2015-11-11 07:42

USACO Section 1.3 Calf Flac

/* PROG : calfflac LANG : C++ */ # include <cstdio> # include <cctype> # define
·2015-11-11 07:40

[集合DP] UVA 10651 Pebble Solitaire

1 /* 2 UVA 10651 - Pebble Solitaire 3 */ 4 # include <cstdio> 5 # inc
·2015-11-11 07:39

UVA 400 Unix ls

# include <cstdio> # include <cstring> # include <cstdlib> # include <cmath>
·2015-11-11 07:36

UVA 10115 Automatic Editing

# include <cstdio> # include <cstring> # define RULESN 10 + 5 # define MAXLEN 80 + 5
·2015-11-11 07:35

COJ 1259: 跳跳

# include <cstdio> # include <queue> # include <cstring> using namespace std;
·2015-11-11 07:34

UVA 644 - Immediate Decodability

. /* 644 - Immediate Decodability */ # include <cstdio> # include &l
·2015-11-11 07:34

HDOJ 4308 Saving Princess claire_

# include <cstdio> # include <cstring> # include <queue> using namespace std;
·2015-11-11 07:33

[字符串]

# include <cstdio> # include <cstring> # define N 10000000 # define LEN 22 typedef
·2015-11-11 07:32

HDOJ 2896 病毒侵袭

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

HDOJ 2222 Keywords Search

# include <cstdio> # include <cstring> # include <queue> using namespace std;
·2015-11-11 07:31

MST 小希的迷宫

pid=1002&ojid=0&cid=1304&hide=0 # include <cstdio> # include <cstring>
·2015-11-11 07:28

WA UVa 10806 - Dijkstra, Dijkstra.

WA # include <cstdio> # include <cstring> # include <queue> # include <algorithm
·2015-11-11 07:27

MST pku 1258 Agri-Net

# include <cstdio> # include <algorithm> using namespace std; # define N 100 + 5
·2015-11-11 07:27

UVa 10986 - Sending email

# include <cstdio> # include <cstring> # include <queue> using namespace std;
·2015-11-11 07:26

PKU 3278 Catch That Cow

# include <cstdio> # include <queue> # include <cstring> using namespace std;
·2015-11-11 07:24

POJ 2488 A Knight's Journey

# include <cstdio> # include <cstring> # define N 26 + 5 const int dx[] = {-1, 1,-
·2015-11-11 07:24

POJ 2243 Knight Moves

# include <cstdio> # include <cstring> # include <queue> using namespace std;
·2015-11-11 07:23

POJ 3620 Avoid The Lakes

# include <cstdio> # include <cstring> # define N 100 + 15 int n, m, k; char lake
·2015-11-11 07:22

HDOJ Another Eight Puzzle

根据题目描述，可以知道 1 和 8 只能放在 C 和 F 两个位置，固定好 1 和 8 后，2 和 7 也就固定了，剩下的就是枚举了； View Code # include <cstdio
·2015-11-11 07:21

DFS专题 Fire Net

# include <cstdio> # include <cstring> # define N 4 + 3 int n, ans; char g[N][N];
·2015-11-11 07:20

DFS 专题 Tempter of the Bone

# include <cstdio> # include <cstring> using namespace std; # define N 7 + 3 # define
·2015-11-11 07:19

DFS 专题 Accepted Necklace

View Code # include <cstdio> # include <cstring> # define N 20 + 5 int ans; int
·2015-11-11 07:19

DFS 专题 Beat

View Code # include <cstdio> # include <cstring> # define N 15 + 5 int n, ans;
·2015-11-11 07:18

DFS 专题 N皇后

# include <cstdio> # include <cstring> # define N 10 + 5 int n, ans; int solu[N];
·2015-11-11 07:17

DFS 专题 哈密顿绕行世界问题

# include <cstdio> # include <cstring> # include <algorithm> using namespace std
·2015-11-11 07:17

DFS专题 下沙小面的(2)

View Code # include <cstdio> # include <cstdlib> # include <cstring> # define
·2015-11-11 07:16

DFS专题 Zipper

View Code # include <cstdio> # include <cstring> # define N 200 + 10 bool
·2015-11-11 07:15

DFS专题 Sum It Up

View Code # include <cstdio> # define N 12 + 5 bool find; int t, n, a[N], solu[N];
·2015-11-11 07:14
上一页 82 83 84 85 86 87 88 89 下一页
按字母分类： ABCDEFGHIJKLMNOPQRSTUVWXYZ其他