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
HDU 4647 Another Graph Game 思路+贪心
#include <cstdio> #include <cstring> #include <
cstdlib
> #include <algorithm
·
2015-11-13 05:06
Graph
URAL 1097 Square Country 2 离散化
1 #include <cstdio> 2 #include <cstring> 3 #include <
cstdlib
> 4 #include &
·
2015-11-13 05:00
count
URAL 1066 Garland 二分
二分H2的位置,判断条件为是否有Hi < 0 1 #include <cstdio> 2 #include <cstring> 3 #include <
cstdlib
·
2015-11-13 05:55
二分
HDU 4630 No Pain No Game 树状数组+离线查询
1 #include <cstdio> 2 #include <cstring> 3 #include <
cstdlib
> 4
·
2015-11-13 05:53
game
SPOJ 416 Divisibility by 15 细节题
1 #include <cstdio> 2 #include <cstring> 3 #include <
cstdlib
&
·
2015-11-13 05:52
visibility
SPOJ 274 Johnny and the Watermelon Plantation(TLE)
1 #include <cstdio> 2 #include <
cstdlib
> 3 #include <cstring> 4 #include &
·
2015-11-13 05:50
water
HDU 4620 Fruit Ninja Extreme 搜索
没想清楚,TLE到死…… 1 #include <cstdio> 2 #include <cstring> 3 #include <
cstdlib
>
·
2015-11-13 05:49
ext
三维计算几何模板[不定期更新]
wenku.baidu.com/view/9d2d5781d4d8d15abe234e35.html 我是用到什么就敲什么,敲好了就放在这里备用 #include <cstdio> #include <
cstdlib
·
2015-11-13 05:46
模板
POJ 2528 Mayor's posters 线段树+离散化
1 #include <cstdio> 2 #include <cstring> 3 #include <
cstdlib
> 4
·
2015-11-13 05:43
post
SPOJ 78 Marbles 组合数学
1个位置里面找k-1个位置放隔板 1 #include <cstdio> 2 #include <cstring> 3 #include <
cstdlib
·
2015-11-13 05:43
poj
ZOJ 1103 Hike on a Graph
1 #include <cstdio> 2 #include <cstring> 3 #include <
cstdlib
> 4
·
2015-11-13 05:41
Graph
UVa 1377 / LA 3667 Ruler
4 5 15 25 35 1 #include <cstdio> 2 #include <cstring> 3 #include <
cstdlib
·
2015-11-13 05:39
Rule
POJ 3450 Corporate Identity
KMP 之前没注意字典序最小,WA了N次…… 1 #include <cstdio> 2 #include <cstring> 3 #include <
cstdlib
·
2015-11-13 05:37
entity
HDU 1540 Tunnel Warfare
1 #include <cstdio> 2 #include <cstring> 3 #include <
cstdlib
> 4
·
2015-11-13 05:36
HDU
codeforces Round #184 Div.2 - B Continued Fractions
long相乘溢出了…… 看了别人的代码才明白,只要思维稍微转化一下,这题就能变得很简单…… 1 #include <cstring> 2 #include <
cstdlib
·
2015-11-13 05:34
codeforces
ZOJ 1426 Counting Rectangles
1 #include <cstdio> 2 #include <cstring> 3 #include <
cstdlib
> 4 #include
·
2015-11-13 05:33
count
FZU 2108 Mod problem
1 #include <cstdio> 2 #include <cstring> 3 #include <
cstdlib
> 4
·
2015-11-13 05:32
em
ZOJ 1387 Decoding Morse Sequences
水动规= = 1 #include <cstdio> 2 #include <cstring> 3 #include <
cstdlib
> 4
·
2015-11-13 05:32
sequence
FZU 2105 Digits Count(AC)
PS2.注意细节 1 #include <cstdio> 2 #include <
cstdlib
> 3 #include <cstring
·
2015-11-13 05:30
count
POJ 2828 Buy Tickets
待编辑 需一步思路转化 1 #include <cstdio> 2 #include <cstring> 3 #include <
cstdlib
>
·
2015-11-13 05:28
poj
HDU 1828 Picture
线段树矩形周长并 1 #include <cstdio> 2 #include <cstring> 3 #include <
cstdlib
>
·
2015-11-13 05:27
HDU
HDU 3308 LCIS
求区间内最长连续上升子序列 线段树典型区间合并 1 #include <cstdio> 2 #include <cstring> 3 #include <
cstdlib
·
2015-11-13 05:27
HDU
HDU 4391 Paint The Wall
线段树 1 #include <cstdio> 2 #include <cstring> 3 #include <
cstdlib
> 4 #include
·
2015-11-13 05:24
paint
HDU 4339 Query
线段树 1 #include <cstdio> 2 #include <cstring> 3 #include <
cstdlib
> 4 #include
·
2015-11-13 05:24
query
ZOJ 1463 Brackets Sequence
区间DP,刘汝佳黑书p113例题 1 #include <cstdio> 2 #include <cstring> 3 #include <
cstdlib
>
·
2015-11-13 05:22
sequence
UVa 1292 - Strategic game
nbsp; 第一次学习树形DP…… 1 #include <cstdio> 2 #include <cstring> 3 #include <
cstdlib
·
2015-11-13 05:20
game
POJ 3232 Accelerator
二分 1 #include <cstdio> 2 #include <cstring> 3 #include <
cstdlib
> 4 #include
·
2015-11-13 05:14
poj
POJ 1195 Mobile phones
id=1195 二维树状数组的应用 1 #include <cstdio> 2 #include <cstring> 3 #include <
cstdlib
·
2015-11-13 05:12
mobile
POJ 2374 Fence Obstacle Course
DP+线段树 View Code 1 #include <cstdio> 2 #include <cstring> 3 #include <
cstdlib
·
2015-11-13 05:12
poj
UVa 10375 - Choose and divide
简单的分解质因数约分 1 #include <cstdio> 2 #include <
cstdlib
> 3 #include <cstring>
·
2015-11-13 05:01
ide
ZOJ 1002 Fire Net
1 #include <cstdio> 2 #include <cstring> 3 #include <
cstdlib
> 4 5 char map
·
2015-11-13 05:55
net
ZOJ 2021 Complicated Expressions
1 //Wrong Answer 2 #include <cstdio> 3 #include <cstring> 4 #include <
cstdlib
·
2015-11-13 05:50
express
sgu 180 Inversions——树状数组求逆序数
WA 12:要用long long,输出用I64d #include<cstdio>#include<
cstdlib
>#include<cstring>#include
·
2015-11-13 05:28
version
HDU 2625 Say love to you once again
View Code #include <iostream> #include <
cstdlib
>
·
2015-11-13 04:12
love
排序集合
#include<cstdio> #include<
cstdlib
> #include<cmath> #include<ctime> void c_sort
·
2015-11-13 04:55
排序
2523 SORT AGAIN
#include<cstdio> #include<
cstdlib
> #include<cmath> #include<cstring> int
·
2015-11-13 04:53
sort
zju 1098 simple computers
#include<cstdio> #include<
cstdlib
> #include<memory.h> #include<cstring> enum
·
2015-11-13 04:52
simple
HDU 2795 Billboard
#include<cstdio> #include<
cstdlib
> #include<cma
·
2015-11-13 04:49
HDU
1754 I Hate It
pid=1754 线段树功能: #include<cstdio> #include<
cstdlib
> #include<cmath> #include<
·
2015-11-13 04:48
it
HDU 1166 敌兵布阵
pid=1166 #include<cstdio>#include<
cstdlib
>#include<cmath>#include<cstring>#define
·
2015-11-13 04:47
HDU
zju 1152 A Mathematical Curiosity
代码: #include<cstdio> #include<
cstdlib
> #include<cmath> int main() {
·
2015-11-13 04:45
Math
hdu 1215 七夕节
#include<cstdio>#include<
cstdlib
>#define M 500001int a[M];int main(){  
·
2015-11-13 04:43
HDU
Codeforces Round #189 (Div. 2)
是不是等于144、14、1,直到为0 代码如下: #include <iostream> #include <cstdio> #include <
cstdlib
·
2015-11-13 04:09
codeforces
hdu1251(Trie树)
#include <iostream> #include <cstdio> #include <cmath> #include <
cstdlib
>
·
2015-11-13 04:35
trie
Poj 3246 Balanced Lineup(线段树基础)
iostream> #include <algorithm> #include <cmath> #include <cstdio> #include <
cstdlib
·
2015-11-13 03:42
poj
HDU 3336 Count the string KMP
AC代码: #include <iostream> #include <cstdio> #include <
cstdlib
> #
·
2015-11-13 03:40
String
HDU 1060 Leftmost Digit
然后求小数部分,然后求幂,ok 代码如下: #include <iostream> #include <cstdio> #include <
cstdlib
·
2015-11-13 03:24
left
POJ 1046 Color Me Less
0MS C++ 664B 2012-05-04 22:34:22 */ #include<cstdio> #include<cstring> #include<
cstdlib
·
2015-11-13 03:10
color
ACdream OJ 1140 Counting Triangles
#include<cstdio> #include<cstring> #include<
cstdlib
> #include<iostream> #
·
2015-11-13 03:08
count
POJ 1631 Bridging signals
125MS C++ 581B 2012-04-22 19:00:19 */ #include<cstdio> #include<cstring> #include<
cstdlib
·
2015-11-13 03:07
Signal
上一页
2
3
4
5
6
7
8
9
下一页
按字母分类:
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
其他