cstdio

hoj 1067 Rails //poj1363 Rails 栈的简单应用

上要把最后的while后的cout<<endl;去掉 */ #include <iostream> #include <stack> #include <cstdio
·2015-11-13 03:14

poj1129Channel Allocation 图的染色问题

#include <iostream> #include <cstdio> #include <string> using namespace std; #define
·2015-11-13 03:07

ural1100 Final Standings

#include <cstdlib> #include <iostream> #include <cstdio> using namespace std;
·2015-11-13 03:49

poj1088 滑雪

若遇到已经遍历过的位置时，直接返回该位置的最优值，完成该次递归 */ #include <iostream> #include <cstring> #include <cstdio
·2015-11-13 03:42

poj3630Phone List用trie树实现

#include <iostream>#include <cstdio>using namespace
·2015-11-13 03:29

poj 2503 Babelfish 用trie树做

现在给出密码文求给出英文解析分析：还是可以用字典树来构造的(当然还可以用快排+二分法，哈希函数做)，先给出trie树的构造吧 #include <iostream>#include <cstdio
·2015-11-13 03:28

POJ2001 Shortest Prefixes 用trie树实现

当找到之前是已经有单词或者该处的单词已经走过该节点，继续往下，直到这两个条件不成立为止#include <iostream>#include <cstring>#include <cstdio
·2015-11-13 03:26

poj3461Oulipo KMP算法

#include <iostream>#include <cstdio>#include <cstring>using namespace std;#define X
·2015-11-13 03:25

HDU1027 （全排列）

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

poj 3468 A Simple Problem with Integers

#include<cstdio> #include<cstdlib> #include<cmath> #include<cs
·2015-11-13 02:52

hdu 1698 Just a Hook

这道题是成段更新，使用延迟标记，对于当前的left<=l&&right>=r直接返回，等到下次更新搜索到时候才向下更新，push_down; #include<cstdio
·2015-11-13 02:51

poj 2886Who Gets the Most Candies?

我的代码如下： #include<cstdio> #include<cstdlib> #include<cmath> #include<memory.h
·2015-11-13 02:50

XMU-1349 xmu_1349

直接模拟： #include<cstdio> #include<cstdlib> #include<cmath> int a[40010]; int m
·2015-11-13 02:49

poj 1987 树的分治

#include<iostream> #include<cstring> #include<algorithm> #include<cstdio>
·2015-11-13 02:04

poj 1741 树的分治

附代码： #include<iostream> #include<cstring> #include<algorithm> #include<cstdio
·2015-11-13 02:03

poj 2104 划分树

思路：裸的划分树 #include<iostream> #include<algorithm> #include<cstring> #include<cstdio
·2015-11-13 02:58

poj 1848 树形dp

，参考网上代码 #include<iostream> #include<algorithm> #include<cstring> #include<cstdio
·2015-11-13 02:58

hdu 4585 set应用

#include<iostream> #include<algorithm> #include<cstring> #include<cstdio>
·2015-11-13 02:56

hdu 4267 树形DP

#include<iostream> #include<algorithm> #include<cstring> #include<cstdio>
·2015-11-13 02:55

hdu 2196 树形dp

#include<iostream> #include<cstring> #include<cstdio> #include<algorithm>
·2015-11-13 02:54

hdu 4251 划分树

思路：裸的划分树 #include<iostream> #include<algorithm> #include<cstdio> #include<cmath
·2015-11-13 02:53

hdu 3473 裸的划分树

#include<iostream> #include<algorithm> #include<cstring> #include<cstdio>
·2015-11-13 02:52

hdu 2665 划分树

思路：裸的划分树 #include<iostream> #include<algorithm> #include<cstring> #include<cstdio
·2015-11-13 02:52

hdu 4417 划分树

#include<iostream> #include<algorithm> #include<cstdio> #include<cmath> #
·2015-11-13 02:51

hdu 4665 搜索

思路：直接搜索 #include<iostream> #include<cstdio> #include<algorithm> #include<cstring
·2015-11-13 02:50

hdu 4647 Another Graph Game

#include<iostream> #include<cstdio> #include<cstring> #include<algorithm>
·2015-11-13 02:47

poj 2057 树形dp 贪心

#include<iostream> #include<cstring> #include<algorithm> #include<cstdio>
·2015-11-13 02:47

poj 2373 单调队列优化背包

#include<iostream> #include<cstdio> #include<cstring> #include<algorithm>
·2015-11-13 02:43

hdu 3622 二分+2-SAT判定

思路：如题 #include<iostream> #include<algorithm> #include<cstring> #include<cstdio
·2015-11-13 02:42

hdu 2844 多重背包+单调队列优化

中的每个状态最大是否为自己，是就+1； #include<iostream> #include<algorithm> #include<cstring> #include<cstdio
·2015-11-13 02:40

poj 2823 单调队列

#include<iostream> #include<cstring> #include<cstdio> #include<algorithm>
·2015-11-13 02:39

poj 3250 栈应用

#include<iostream> #include<cstring> #include<algorithm> #include<cstdio>
·2015-11-13 02:38

hdu 4632 动态规划

str[j]，那么dp[i][j]+=dp[i+1][j-1]+1; #include<iostream> #include<cstring> #include<cstdio
·2015-11-13 02:37

hdu 4642 博弈

思路：不管是Alice,还是Bob，每次操作都会影响最右下角的数，那么如果是1，Alice赢，否则Bob赢 #include<iostream> #include<cstdio&
·2015-11-13 02:35

hdu 4000 树状数组

#include<iostream> #include<cstdio> #include<cstring> #include<algorithm>
·2015-11-13 02:35

hdu 4325 树状数组+离散化

这个代码怎一个挫字了得 #include<iostream> #include<cstdio> #include<cstring> #include<
·2015-11-13 02:34

hdu 1892 树状数组

#include<iostream> #include<cstring> #include<algorithm> #include<cstdio>
·2015-11-13 02:33

hdu3584 树状数组

#include<iostream> #include<cstring> #include<algorithm> #include<cstdio>
·2015-11-13 02:32

hdu 4628 动态规划

#include<iostream> #include<cstdio> #include<cstring> #define inf 1<<30 using
·2015-11-13 02:31

hdu 2838 树状数组

#include<iostream> #include<cstring> #include<algorithm> #include<cstdio>
·2015-11-13 02:30

hdu 2852 树状数组

#include<iostream> #include<cstdio> #include<cstring> #include<algorithm>
·2015-11-13 02:29

hdu 3743 树状数组

#include<iostream> #include<cstdio> #include<algorithm> #include<cst
·2015-11-13 02:28

poj 1904 强连通分量

#include<iostream> #include<cstdio> #include<cstring> #incl
·2015-11-13 02:26

poj 3264 RMQ

#include<iostream> #include<cstdio> #include<cstring> #include<algorithm>
·2015-11-13 02:26

hdu 4421 2-SAT问题

#include<iostream> #include<cstdio> #include<algorithm> #include<cstring>
·2015-11-13 02:25

hdu 4009 最小树形图

#include<iostream> #include<cstdio> #include<cstring> #include<algorithm>
·2015-11-13 02:23

poj 3207 2-SAT问题

具体见代码 #include<iostream> #include<cstdio> #include<algo
·2015-11-13 02:22

poj 2749 2-SAT问题

#include<iostream> #include<cstring> #include<cstdio> #include<algorithm
·2015-11-13 02:21

poj 3648 2-SAT问题

具体看注释 #include<iostream> #include<cstdio> #include<algorithm> #include<cstring
·2015-11-13 02:21

poj 3678 2-SAT问题

#include<iostream> #include<cstring> #include<cstdio> #include<algorithm>
·2015-11-13 02:20
上一页 28 29 30 31 32 33 34 35 下一页
按字母分类： ABCDEFGHIJKLMNOPQRSTUVWXYZ其他