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
climits
[itint5]合并K个有序链表
#include <
climits
> /*链表结点的定义(请不要在代码中定义该类型) struct ListNode { int val; ListNode *
·
2015-11-10 21:17
int
PAT 1056 Mice and Rice
#include <cstdio> #include <
climits
> #include <cstdlib> #include <vector>
·
2015-11-09 14:25
ICE
PAT 1030 Travel Plan
; #include <queue> #include <unordered_map> #include <algorithm> #include <
climits
·
2015-11-09 14:23
pat
poj 1469(二分图 最大匹配)
cstdio> #include<iostream> #include<cstring> #include<algorithm> #include<
climits
·
2015-11-08 15:55
poj
POJ 1459(EK)
2 #include<cstring> 3 #include<iostream> 4 #include<queue> 5 #include <
climits
·
2015-11-08 13:29
poj
*[hackerrank]Cut the tree
#include <cstdlib> #include <
climits
> #include <algorithm> #include &
·
2015-11-08 13:07
tree
PAT 1044. Shopping in Mars
#include <cstdio> #include <cstdlib> #include <vector> #include <
climits
>
·
2015-11-08 12:32
ping
PAT 1085. Perfect Sequence
#include <cstdio> #include <
climits
> #include <cstdlib> #include <algorithm>
·
2015-11-08 12:30
sequence
PAT 1043 Is It a Binary Search Tree
#include <cstdio> #include <
climits
> #include <cstdlib> #include <vector>
·
2015-11-08 12:17
Binary search
Hdu 1162 Eddy's picture
nbsp;<cstdlib> #include <cstring> #include <cmath> #include <
climits
·
2015-11-08 11:26
HDU
hihoCoder#1077 RMQ问题再临-线段树
代码: 1 #include <iostream> 2 #include <
climits
> 3 using namespace std;
·
2015-11-08 10:41
code
TSP-旅行商问题
#include <iostream> #include <cstring> #include <cstdlib> #include <
climits
>
·
2015-11-07 11:31
问题
uva 11538 计数原理
#include <iostream> 2 #include <cstring> 3 #include <cstdio> 4 #include <
climits
·
2015-11-02 19:49
uva
POJ 1125 Stockbroker Grapevine
algorithm> #include <cstring> #include <stack> #include <queue> //#include <
climits
·
2015-11-02 18:17
broker
AC自动机模板
View Code #include <cstdio> #include <cstdlib> #include <string> #include <
climits
·
2015-11-02 11:26
AC自动机
宏中"#"和"##"的用法
用法: #include<cstdio> #include<
climits
> using
·
2015-11-01 15:26
用法
POJ 3522 Slim Span
#include<cstdio> 2 #include<iostream> 3 #include<algorithm> 4 #include<
climits
·
2015-11-01 15:19
span
《Cracking the Coding Interview》——第3章:栈和队列——题目5
代码: 1 // 3.5 Implement a queue MyQueue using two stacks. 2 #include <
climits
> 3 #i
·
2015-10-31 15:28
interview
POJ_1698_Alice's Chance
#include <iostream> #include <queue> #include <
climits
> #include <cstring>
·
2015-10-31 14:41
poj
[POJ][3285][Point of view in Flatland][模拟退火]
中等偏难题目内容或思路: 模拟退火 这题的难点在找到合适的评估函数做题日期:2011.3.9*/#include <cstdio>#include <cstdlib>#include <
climits
·
2015-10-31 10:57
view
[POJ][1755][Triathlon][半平面交]
计算几何的题目能特判的就特判这样可以在一定程度上避免精度问题做题日期:2011.2.25*/#include <cstdio>#include <cstdlib>#include <
climits
·
2015-10-31 10:56
poj
[POJ][3845][Fractal][坐标旋转]
中等题目内容或思路: 坐标旋转 此题注意eps的取值做题日期:2011.2.26*/#include <cstdio>#include <cstdlib>#include <
climits
·
2015-10-31 10:56
poj
[POJ][1271][Nice Milk][半平面交]
做题日期:2011.2.28*/#include <cstdio>#include <cstdlib>#include <
climits
>#include <iostream
·
2015-10-31 10:56
poj
Hdu1698Just a Hook线段树区间更新
#include <cstdio> #include <cstring> #include <algorithm> #include <
climits
>
·
2015-10-31 10:45
HDU
Hdu1754单点更新
#include <cstdio> #include <cstring> #include <algorithm> #include <
climits
>
·
2015-10-31 10:44
HDU
Hdu1166单点更新线段树
#include <cstdio> #include <cstring> #include <algorithm> #include <
climits
>
·
2015-10-31 10:44
HDU
DpUVALive 6177The King's Ups and Downs
#include <cstdio> #include <cstring> #include <algorithm> #include <
climits
>
·
2015-10-31 10:44
live
Poj2886Who Gets the Most Candies?线段树
#include <cstdio> #include <cstring> #include <algorithm> #include <
climits
>
·
2015-10-31 10:44
get
poj3468A Simple Problem with Integers区间和线段树
#include <cstdio> #include <cstring> #include <algorithm> #include <
climits
>
·
2015-10-31 10:44
Integer
Poj2828Buy Tickets线段树
#include <cstdio> #include <cstring> #include <algorithm> #include <
climits
>
·
2015-10-31 10:44
poj
Poj2528Mayor's posters线段树
#include <cstdio> #include <cstring> #include <algorithm> #include <
climits
>
·
2015-10-31 10:44
post
zoj3471Most Powerful 状压dp
cstdio> #include <cstring> #include <cmath> #include <algorithm> #include <
climits
·
2015-10-31 10:43
ZOJ
poj3311Hie with the Pie状压dp
cstdio> #include <cstring> #include <cmath> #include <algorithm> #include <
climits
·
2015-10-31 10:43
with
poj3254Corn Fields状压Dp
cstdio> #include <cstring> #include <cmath> #include <algorithm> #include <
climits
·
2015-10-31 10:43
Field
Hdu3681Prison Break状压Dp
cstdio> #include <cstring> #include <cmath> #include <algorithm> #include <
climits
·
2015-10-31 10:43
break
poj2240Arbitrage最长路
cstdio> #include <cstring> #include <cmath> #include <algorithm> #include <
climits
·
2015-10-31 10:43
poj
CF339D Xenia and Bit Operations线段树
sum[1]; #include <cstdio> #include <cstring> #include <algorithm> #include <
climits
·
2015-10-31 10:43
Opera
CF414BMashmokh and ACMDP
cstdio> #include <cstring> #include <cmath> #include <algorithm> #include <
climits
·
2015-10-31 10:43
ACM
cf55dBeautiful numbers数位dp
可是没想到 #include <cstdio> #include <cstring> #include <algorithm> #include <
climits
·
2015-10-31 10:42
number
Hdu3079Balanced Number数位dp
#include <cstdio> #include <cstring> #include <algorithm> #include <
climits
>
·
2015-10-31 10:42
number
Hdu3652B-number数位dp
62那样搞 #include <cstdio> #include <cstring> #include <algorithm> #include <
climits
·
2015-10-31 10:42
number
Hdu3555Bomb数位dp
也可以直接搞 #include <cstdio> #include <cstring> #include <algorithm> #include <
climits
·
2015-10-31 10:42
HDU
poj1703并查集
#include <cstdio> #include <cstring> #include <algorithm> #include <
climits
>
·
2015-10-31 10:42
poj
Balanced Numbers数位dp
#include <cstdio> #include <cstring> #include <algorithm> #include <
climits
>
·
2015-10-31 10:42
number
poj1466二分图
;最大匹配 #include <cstdio> #include <cstring> #include <algorithm> #include <
climits
·
2015-10-31 10:41
poj
poj1469二分图
#include <cstdio> #include <cstring> #include <algorithm> #include <
climits
>
·
2015-10-31 10:41
poj
poj1422最大独立点集合
最大匹配 #include <cstdio> #include <cstring> #include <algorithm> #include <
climits
·
2015-10-31 10:41
poj
Little Elephant and Elections小象选举
cstdio> #include <cstring> #include <cmath> #include <algorithm> #include <
climits
·
2015-10-31 10:41
ant
poj1128拓扑排序
拓扑排序 #include <cstdio> #include <cstring> #include <algorithm> #include <
climits
·
2015-10-31 10:41
poj
poj3252数位dp
#include <cstdio> #include <cstring> #include <algorithm> #include <
climits
>
·
2015-10-31 10:41
poj
上一页
1
2
3
4
下一页
按字母分类:
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
其他