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
最长回文串O(N)算法 manacher
// 原串最大长度N// 返回最大回文字串 res#include<cstdio> #include<cstring> #include<
cstdlib
> #include
·
2015-11-11 11:01
man
西山居初赛二 总结
#include<cstdio> #include<cstring> #include<
cstdlib
> #include<algorithm>
·
2015-11-11 11:59
总结
西山居初赛三 总结
#include<cstdio> #include<
cstdlib
> #include<cstring> using namespac
·
2015-11-11 11:58
总结
[Wc2006]水管局长数据加强版 LCA&RMQ
#include<cstdio> #include<
cstdlib
> #include<cstri
·
2015-11-11 11:56
MQ
NB 2013-5-1 赛后随笔
View Code #include<cstdio> #include<
cstdlib
> #include<cstring> char mp[110]
·
2015-11-11 11:46
随笔
2013多校第四场 G题 ZZ的搬砖难题
View Code #include<cstdio> #include<
cstdlib
> #include
·
2015-11-11 11:43
矩阵乘法模板
#include<cstdio> #include<
cstdlib
> #include<cstring> #include<algorithm>
·
2015-11-11 11:36
模板
whu 1473 - Check the Identity 乱搞
#include<cstdio> #include<cstring> #include<
cstdlib
> #include<algorithm>
·
2015-11-11 11:35
entity
poj 1403 What's In A Name? 唯一匹配
View Code #include<cstdio> #include<cstring> #include<
cstdlib
> #include<algori
·
2015-11-11 11:22
name
HDU 4460 Friend Chains --BFS
代码: #include <iostream> #include <cstdio> #include <cstring> #include <
cstdlib
·
2015-11-11 11:45
chain
HDU 4782 Beautiful Soup --模拟
代码: #include <iostream> #include <cstdio> #include <cstring> #include <
cstdlib
·
2015-11-11 11:37
HDU
UESTC 1014 Shot
#include<cmath> #include<cstring> #include<algorithm> #include<
cstdlib
·
2015-11-11 11:31
sh
rand srand产生伪随机数方法总结
标准库<
cstdlib
>(被包含于<iostream>)提供两个生成伪随机数的函数。
·
2015-11-11 10:23
随机数
poj3002
简单题 View Code #include <iostream>#include <
cstdlib
>#include <cstring>#include
·
2015-11-11 10:34
poj
poj2954
View Code #include <iostream>#include <
cstdlib
>#include <cstring>#include <cstdio
·
2015-11-11 10:33
poj
poj2967
View Code #include <iostream>#include <
cstdlib
>#include <cstring>#include <cstdio
·
2015-11-11 10:33
poj
poj2940
简单题 View Code #include <iostream>#include <
cstdlib
>#include <cstring>#include
·
2015-11-11 10:32
poj
poj2907
枚举 View Code #include <iostream>#include <
cstdlib
>#include <cstring>#include
·
2015-11-11 10:30
poj
poj2894
简单题 View Code #include <iostream>#include <
cstdlib
>#include <cstring>#include
·
2015-11-11 10:29
poj
poj2860
简单题 View Code #include <iostream>#include <
cstdlib
>#include <cstring>#include
·
2015-11-11 10:28
poj
poj2887
View Code #include <iostream>#include <
cstdlib
>#include <cstring>#include <cstdio
·
2015-11-11 10:28
poj
poj2780
同2606 View Code #include <iostream>#include <cstdio>#include <
cstdlib
>#include
·
2015-11-11 10:27
poj
poj2685
简单题 View Code #include <iostream>#include <
cstdlib
>#include <cstring>#include
·
2015-11-11 10:26
poj
poj2673
简单题 View Code #include <iostream>#include <
cstdlib
>#include <cstring>#include
·
2015-11-11 10:25
poj
poj2661
简单题 View Code #include <iostream>#include <
cstdlib
>#include <cstring>#include
·
2015-11-11 10:23
poj
poj2640
分析:先排序,看前i个的和是否大于第i+1个,若大于则可以 View Code #include <iostream>#include <
cstdlib
>#include
·
2015-11-11 10:23
poj
poj2629
简单题 View Code #include <iostream>#include <
cstdlib
>#include <cstring>#include
·
2015-11-11 10:22
poj
poj2624
简单题 View Code #include <iostream>#include <
cstdlib
>#include <cstring>#include
·
2015-11-11 10:21
poj
poj1260
< iostream > #include < cstdio > #include <
cstdlib
·
2015-11-11 10:18
poj
poj3176
< iostream > #include < cstdio > #include <
cstdlib
·
2015-11-11 10:18
poj
poj1606
< iostream > #include < cstdio > #include <
cstdlib
·
2015-11-11 10:16
poj
poj1416
< iostream > #include < cstdio > #include <
cstdlib
·
2015-11-11 10:16
poj
poj3414
< iostream > #include < cstdio > #include <
cstdlib
·
2015-11-11 10:15
poj
poj3009
< iostream > #include < cstdio > #include <
cstdlib
·
2015-11-11 10:13
poj
poj3020
< iostream > #include < cstdio > #include <
cstdlib
·
2015-11-11 10:10
poj
poj3026
< iostream > #include < cstdio > #include <
cstdlib
·
2015-11-11 10:09
poj
poj1163
< iostream > #include < cstdio > #include <
cstdlib
·
2015-11-11 10:08
poj
poj1160
< iostream > #include < cstdio > #include <
cstdlib
·
2015-11-11 10:07
poj
Codeforces Round #191 (Div. 2) E题
2 #include <cstring> 3 #include <cstdio> 4 #include <queue> 5 #include <
cstdlib
·
2015-11-11 10:25
codeforces
HDU 4605 Magic Ball Game(离线算法)
comment(linker, "/STACK:1024000000,1024000000") 2 #include <cstdio> 3 #include <
cstdlib
·
2015-11-11 10:23
game
HDU 4618 Palindrome Sub-Array(DP)
题目链接 我还是图样啊....比赛的时候没敢暴力去搜... 1 #include <cstdio> 2 #include <
cstdlib
> 3 #include
·
2015-11-11 10:22
array
POJ 3318 Matrix Multiplication(随机算法)
1 #include <cstdio> 2 #include <
cstdlib
> 3 #include <cstring> 4 #include
·
2015-11-11 10:21
Matrix
poj1247 bjfu1239水题
不多说了,上代码 /* * Author : ben */ #include <cstdio> #include <
cstdlib
> #include &
·
2015-11-11 10:08
poj
bjfu1235 两圆公共面积
代码如下: /* * Author : ben */ #include <cstdio> #include <
cstdlib
> #include <
·
2015-11-11 10:02
B
hdu 1544 水题
水题 /* * Author : ben */ #include <cstdio> #include <
cstdlib
> #include <cstring
·
2015-11-11 10:59
HDU
hdu1792 水题
/* * Author : ben */ #include <cstdio> #include <
cstdlib
> #include <cstring&
·
2015-11-11 10:58
HDU
hdu 1557暴力枚举
hdu1557/win.cpp * Created on: 2013-6-1 * Author : ben */ #include <cstdio> #include <
cstdlib
·
2015-11-11 10:57
HDU
hdu1113大水题
hdu1113/win.cpp * Created on: 2013-6-1 * Author : ben */ #include <cstdio> #include <
cstdlib
·
2015-11-11 10:56
HDU
hdu 1225大水题
hdu1225/win.cpp * Created on: 2013-5-31 * Author : ben */ #include <cstdio> #include <
cstdlib
·
2015-11-11 10:56
HDU
hdu2102广搜
/win.cpp * Created on: 2012-11-28 * Author : ben */ #include <cstdio> #include <
cstdlib
·
2015-11-11 10:51
HDU
上一页
15
16
17
18
19
20
21
22
下一页
按字母分类:
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
其他