E-COM-NET
首页
在线工具
Layui镜像站
SUI文档
联系我们
推荐频道
Java
PHP
C++
C
C#
Python
Ruby
go语言
Scala
Servlet
Vue
MySQL
NoSQL
Redis
CSS
Oracle
SQL Server
DB2
HBase
Http
HTML5
Spring
Ajax
Jquery
JavaScript
Json
XML
NodeJs
mybatis
Hibernate
算法
设计模式
shell
数据结构
大数据
JS
消息中间件
正则表达式
Tomcat
SQL
Nginx
Shiro
Maven
Linux
cstdlib
poj2385
动态规划 View Code #include <iostream>#include <
cstdlib
>#include <cstring>#include
·
2015-11-12 17:53
poj
poj2007
View Code #include <iostream>#include <
cstdlib
>#include <cstring>#include <cstdio
·
2015-11-12 17:52
2007
poj1995
快速幂 View Code #include <iostream>#include <
cstdlib
>#include <cstring>#include
·
2015-11-12 17:51
poj
poj1847
最短路 View Code #include <iostream>#include <
cstdlib
>#include <cstring>#include
·
2015-11-12 17:50
poj
poj1442
树状数组 View Code #include <iostream>#include <
cstdlib
>#include <cstring>#include
·
2015-11-12 17:49
poj
poj1386
欧拉通路 View Code #include <iostream>#include <
cstdlib
>#include <cstring>#include
·
2015-11-12 17:48
poj
poj1404
动态规划 注意多解的情况 View Code #include <iostream>#include <
cstdlib
>#include <cstring>
·
2015-11-12 17:48
poj
poj1081
dfs View Code #include <iostream>#include <cstdio>#include <
cstdlib
>#include
·
2015-11-12 17:45
poj
poj1040
dfs 没剪枝就过了…… View Code #include <iostream>#include <cstdio>#include <
cstdlib
>
·
2015-11-12 17:45
poj
poj1101
bfs 细节处理比较麻烦 View Code #include <iostream>#include <cstdio>#include <
cstdlib
>
·
2015-11-12 17:44
poj
poj2945
View Code #include <iostream>#include <cstdio>#include <
cstdlib
>#include <cstring
·
2015-11-12 17:41
poj
poj1434
二分 简单题 View Code #include <iostream>#include <cstdio>#include <
cstdlib
>#include
·
2015-11-12 17:40
poj
poj3737
三分法求单峰函数极值 View Code #include <iostream>#include <cstdio>#include <
cstdlib
>#include
·
2015-11-12 17:38
poj
poj3740
dfs View Code #include <iostream>#include <cstdio>#include <
cstdlib
>#include
·
2015-11-12 17:38
poj
poj3723
最小生成树,稀疏图用kruskal,O(ElogE) View Code #include <iostream>#include <cstdio>#include <
cstdlib
·
2015-11-12 17:36
poj
poj3720
简单题 View Code #include <iostream>#include <cstdio>#include <
cstdlib
>#include
·
2015-11-12 17:35
poj
poj3112
简单题 View Code #include <iostream>#include <cstdio>#include <
cstdlib
>#include
·
2015-11-12 17:34
poj
poj3099
bfs View Code #include <iostream>#include <cstdio>#include <
cstdlib
>#include
·
2015-11-12 17:34
poj
poj 2632 Crashing Robots_模拟
题意:给你机器人怎走的路线,碰撞就输出 #include <
cstdlib
> #include <iostream> #include<cstdio> #include
·
2015-11-12 17:26
Crash
poj 1573 Robot Motion_模拟
#include <
cstdlib
> #include <iostream> #include<cstdio> using namespace std; #define
·
2015-11-12 17:25
robot
hdu 4619 Warm up 2_最大独立集
题意:给竖着和横着的方块,除去重叠的,最多能留下几个方块 #include <
cstdlib
> #include <iostream> using namespace std
·
2015-11-12 17:24
HDU
libsvm 接口 [供自己的C/C++程序训练预测用]
. */ #include <cstdio> #include <iostream> #include <
cstdlib
> #include <ctime
·
2015-11-12 17:48
c/c++
POJ 3070 Fibonacci(矩阵乘法logN)
思路: 矩阵的n次方可以由二分法来解决,于是把时间缩短到了logN #include <cstdio> #include <
cstdlib
> #include
·
2015-11-12 17:32
fibonacci
UVa 11258 String Partition(简单DP)
思路: dp[i]表示前i个字符能组成的最大数 #include <cstdio> #include <
cstdlib
> #include <cstring>
·
2015-11-12 17:28
partition
UVa 10626 Buying Coke(记忆化搜索)
#include <cstdio> #include <
cstdlib
> #include &
·
2015-11-12 17:24
uva
UVa 10313 Pay the Price(类似数字分解DP)
不包括j : f[i, j] += f[i-j, j-1]; 可以收缩为一维数组,具体见代码: #include <cstdio> #include <
cstdlib
> #
·
2015-11-12 17:21
ICE
UVa 10453 Make Palindrome(简单DP)
#include <cstdio> #include <
cstdlib
> #include <cstring> #include <algorithm>
·
2015-11-12 17:19
Make
UVa 10651 Pebble Solitaire(状态压缩DP)
#include <cstdio> #include <
cstdlib
> #include <cstring> #define
·
2015-11-12 17:12
AIR
UVa 825 Walking on the Safe Side(简单DP)
#include <cstdio> #include <
cstdlib
>
·
2015-11-12 17:09
ide
UVa 437 The Tower of Babylon(简单DP)
#include <cstdio> #include <
cstdlib
> #include <cstring&
·
2015-11-12 17:09
uva
UVa 10404 Bachet's Game(简单DP)
#include <cstdio> #include <
cstdlib
> #include <cstring> bool dp[1000010]; int
·
2015-11-12 17:08
game
UVa 624 CD(01背包并打印)
#include <cstdio> #include <
cstdlib
> #include <cstring> const int MAXN = 10010
·
2015-11-12 17:07
uva
UVa 348 Optimal Array Multiplication Sequence(链式DP/区间DP)
#include <cstdio> #include <
cstdlib
> #include <cstring> #include <climits>
·
2015-11-12 17:06
sequence
UVa 100131 Is Bigger Smarter(LIS)
思路: 先对于象的体重进行从小到大排序,然后对其智商进行最长下降子序列选择 #include <cstdio> #include <
cstdlib
> #include
·
2015-11-12 17:05
uva
UVa 116 Unidirectional TSP(简单旅行商DP)
#include <cstdio> #include <
cstdlib
> #include <cstring> #define min(a,b) (((a)
·
2015-11-12 17:04
uva
UVa 562 Dividing coins(简单DP)
#include <cstdio> #include <
cstdlib
> #include <cstring> #define ma
·
2015-11-12 17:04
div
UVa 10003 Cutting Sticks(区间DP)
#include <cstdio> #include <
cstdlib
> #include <cst
·
2015-11-12 17:03
uva
UVa 10405 Longest Common Subsequence(LCS)
#include <cstdio> #include <
cstdlib
> #include <cstring> #define max(a,b) (((a)
·
2015-11-12 17:02
sequence
UVa 674 Coin Change(经典DP)
也可以dfs记忆化搜索) View Code #include <cstdio> #include <
cstdlib
>
·
2015-11-12 17:02
change
UVa 111 History Grading (最长公共子序列)
比如如果输入是1 3 4 2,那么实际上事件序列是1 4 2 3 思路: 略 #include <cstdio> #include <
cstdlib
> #include
·
2015-11-12 17:01
history
UVa 103 Stacking Box(记忆化搜索)
#include <cstdio> #include <
cstdlib
> #include &l
·
2015-11-12 17:00
stack
HDOJ 3449 Consumer(简单的依赖背包)
至于为什么,因为后一种则就是表示每个物品代价是p+ci,而非ci了,所以此时就会计算错误 #include <cstdio> #include <
cstdlib
> #include
·
2015-11-12 17:58
SUM
母函数入门(杭电教程题目)
HDOJ 1398 ( Square Coins ) View Code #include <cstdio> #include <
cstdlib
·
2015-11-12 17:55
函数
POJ 3080 Blue Jeans (kmp)
至于为什么不用枚举完所有的子串,因为kmp的过程中已经有过子串的匹配过程 #include <iostream> #include <cstdio> #include <
cstdlib
·
2015-11-12 17:54
poj
POJ 2406 入门KMP
以前写过一点字符串匹配方面的题目,但是理解不深刻,这次打算从入门级的步步深入 题意:求字符串子串的最大周期,至于要对字符串进行一遍预处理即可 #include <cstdio> #include <
cstdlib
·
2015-11-12 17:54
poj
HDOJ 4341 Gold miner(分组DP)
就题目来说还是属于比较常规的分组DP,处理点与点之间的关系稍微麻烦点,借鉴了网上结构体重载的方法 #include <cstdio> #include <
cstdlib
>
·
2015-11-12 17:52
Go
POJ 3345 Bribing FIPA(树形DP)
www.cppblog.com/Yuan/archive/2010/04/28/113833.html以后有待于研究下红黑树了#include <cstdio> #include <
cstdlib
·
2015-11-12 17:51
bing
POJ 1018 Communication System(分组背包DP)
每组选择一个 ,这两类的差别就是在与dp数组的初始化问题 #include <cstdio> #include <
cstdlib
> #include <cstring
·
2015-11-12 17:50
System
HDOJ 4276 The Ghost Blows Light(树形DP)
此题很好,很费脑力,还好以前把背包9讲看完了,这次容易理解点 #include <cstdio> #include <
cstdlib
> #include &
·
2015-11-12 17:50
host
HDOJ 3496 Watch The Movie(基本二维背包)
#include <cstdio> #include <
cstdlib
> #include <cstring> #define max(a,b) ((
·
2015-11-12 17:49
IE
上一页
8
9
10
11
12
13
14
15
下一页
按字母分类:
A
B
C
D
E
F
G
H
I
J
K
L
M
N
O
P
Q
R
S
T
U
V
W
X
Y
Z
其他