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
cstdio
hdu 1078 FatMouse and Cheese 记忆化dp
#include<
cstdio
> #include<iostream> #include<algorithm> using namespace
·
2015-11-11 10:02
HDU
poj 3352 双连通分量
至少加几条边成为双连通分量 #include <iostream> #include <
cstdio
> #include <cstring>
·
2015-11-11 10:45
poj
[poj][3845][Fractal]
(一开始有点搞不明白,后来才确定就是把起始点和结束点缩放到每一条边的端点上) 普通方法 View Code #include <
cstdio
> #include <cstring
·
2015-11-11 10:13
poj
[zoj][3395][Stammering Aliens]
View Code #include <
cstdio
> #include <cstring> #inclu
·
2015-11-11 10:12
ZOJ
[spoj][220][Relevant Phrases of Annihilation]
View Code #include <
cstdio
> #inclu
·
2015-11-11 10:12
ant
[spoj][11574][A Famous Stone Collector]
View Code #include <
cstdio
> #include <cstring> #include <algorithm> using namespace
·
2015-11-11 10:11
Collector
HDU 4669 Mutiples on a circle(环状DP)
1 #include <
cstdio
> 2 #incl
·
2015-11-11 10:43
HDU
HDU 2852 KiKi's K-Number(离线+树状数组)
1 #include <
cstdio
> 2 #include <cstring> 3 #include <iostream> 4 using namespace
·
2015-11-11 10:42
number
HDU 4666 Hyperspace(曼哈顿距离)
1 #include <
cstdio
> 2 #include <cstring> 3 #include <set> 4 #include <iostream
·
2015-11-11 10:41
HDU
POJ 3335 Rotating Scoreboard(多边形的核)
1 #include <
cstdio
> 2 #include <cstring> 3 #include <string> 4
·
2015-11-11 10:40
core
POJ 3277 City Horizon(扫描线+线段树)
1 #include <
cstdio
> 2 #include <cstring> 3 #include <string> 4 #include <
·
2015-11-11 10:40
poj
POJ 1177 Picture(求周长并)
1 #include <
cstdio
> 2 #include <cstring> 3 #include <string> 4 #include <
·
2015-11-11 10:38
poj
POJ 1095 Trees Made to Order(卡特兰数列)
. + h(n-1)h(0) (n>=2) 1 #include <
cstdio
> 2 #include <string> 3 #include <cstring
·
2015-11-11 10:37
order
POJ 1734 Sightseeing trip(无向图最小环+输出路径)
题目链接 1 #include <
cstdio
> 2 #include <string> 3 #include <cstring> 4 #include
·
2015-11-11 10:36
poj
POJ 2112 Optimal Milking(最大流+二分)
1 #include <
cstdio
> 2 #include <string> 3 #include <cstring> 4 #include <
·
2015-11-11 10:36
poj
HDU 4671 Partition(定理题)
1 #include <
cstdio
> 2 #include <cstring> 3 #include <string> 4 #include <algorithm
·
2015-11-11 10:35
partition
HDU 4647 Another Graph Game(贪心)
1 #include <
cstdio
> 2 #include <string> 3 #include <cstring> 4 #include <algorithm
·
2015-11-11 10:34
Graph
HDU 4648 Magic Pen 6
1 #include <
cstdio
> 2 #include <cstring> 3 #include <string> 4 #include <algorithm
·
2015-11-11 10:33
HDU
HDU 4649 Professor Tian(DP)
1 #include <
cstdio
> 2 #include <cstring> 3 #include <string> 4 #include <algorithm
·
2015-11-11 10:33
SSO
POJ 2104 K-th Number(划分树)
1 #include <
cstdio
> 2 #include <cstring> 3 #include <algorithm> 4 using namespace
·
2015-11-11 10:31
number
HDU 4417 Super Mario(划分树+二分)
题目链接 1 #include <
cstdio
> 2 #include <cstring> 3 #include <algorithm> 4
·
2015-11-11 10:31
super
HDU 4630 No Pain No Game(树状数组)
1 #include <
cstdio
> 2 #include <cstring> 3 #include &
·
2015-11-11 10:29
game
POJ 1625 Censored!(大数+DP)
1 #include <iostream> 2 #include <cstring> 3 #include <
cstdio
> 4 #include
·
2015-11-11 10:28
poj
HDU 4057 Rescue the Rabbit(AC自动机+DP)
1 #include <iostream> 2 #include <cstring> 3 #include <
cstdio
> 4 #include
·
2015-11-11 10:27
AC自动机
Codeforces Round #191 (Div. 2) E题
1 #include <iostream> 2 #include <cstring> 3 #include <
cstdio
> 4 #include <
·
2015-11-11 10:25
codeforces
HDU 4605 Magic Ball Game(离线算法)
1 #pragma comment(linker, "/STACK:1024000000,1024000000") 2 #include <
cstdio
> 3
·
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
HDU 4604 Deque(最长上升子序)
代码里4个二分.... 1 #include <
cstdio
> 2 #include <cstring> 3 #include <iostream>
·
2015-11-11 10:20
deque
POJ 2891 Strange Way to Express Integers(中国剩余定理)
题目链接 虽然我不懂... 1 #include <
cstdio
> 2 #include <cstring> 3 #include <map> 4
·
2015-11-11 10:20
Integer
POJ 3440 Coin Toss(概率)
1 #include <
cstdio
> 2 #include <cstring> 3 #include <iostream> 4 #include <
·
2015-11-11 10:19
poj
POJ 3071 Football(概率DP)
1 #include <
cstdio
> 2 #include <cstring> 3 #include <iostream> 4 #include <
·
2015-11-11 10:18
poj
POJ 3270 Cow Sorting(置换群)
1 #include <
cstdio
> 2 #include <cstring> 3 #include <iostream> 4 #include <
·
2015-11-11 10:18
sort
POJ 3140 Contestants Division
2B错误,导致WA了多次,无向图,建图搞成了有向了.... 1 #include <
cstdio
> 2 #include <cstring> 3 #include
·
2015-11-11 10:17
visio
UVA 10325 - The Lottery(容斥)
1 #include <
cstdio
> 2 #include <cstring> 3 #include <iostream> 4 #include <
·
2015-11-11 10:16
uva
POJ 1947 Rebuilding Roads(树形DP)
1 #include <
cstdio
> 2 #include <cstring> 3 #include <iostream> 4 #include <
·
2015-11-11 10:14
Build
POJ 3034 Whac-a-Mole(DP)
1 #include <
cstdio
> 2 #include <cstring> 3 #include <iostream> 4 #include <
·
2015-11-11 10:13
poj
POJ 2948 Martian Mining(DP)这是POJ第200道,居然没发现
1 #include <
cstdio
> 2 #include <cst
·
2015-11-11 10:12
poj
POJ 1925 Spiderman(DP)
1 #include <
cstdio
> 2 #include <cstring> 3 #include <iostream> 4 #include <
·
2015-11-11 10:11
spider
Vijos 1061 迎春舞会之三人组舞(DP)
1 #include <
cstdio
> 2 #include <cstring> 3 #include <iostream> 4 #include <
·
2015-11-11 10:10
OS
POJ 1054 The Troublesome Frog
1 #include <
cstdio
> 2 #include <cstring> 3 #include <iostream> 4 #include <
·
2015-11-11 10:09
poj
POJ 3280 Cheapest Palindrome(DP)
1 #include <
cstdio
> 2 #include <cstring> 3 #include <iostream> 4 using namespace
·
2015-11-11 10:08
heap
POJ 1191 棋盘分割(DP)
1 #include <
cstdio
> 2 #include <cstring> 3 #include <iostream> 4 #include <
·
2015-11-11 10:08
poj
POJ 1724 ROADS(二维SPFA)
1 #include <cstring> 2 #include <
cstdio
> 3 #include <string> 4 #include <iostream
·
2015-11-11 10:07
SPFA
POJ 1691 Painting A Board(迭代深搜)
1 #include <
cstdio
> 2 #include <cstring> 3 #include <iostream> 4 usi
·
2015-11-11 10:06
paint
POJ 3411 Paid Roads(DFS)
1 #include <cstring> 2 #include <
cstdio
> 3 #include <string> 4 #include <iostream
·
2015-11-11 10:05
poj
POJ 1699 Best Sequence(DFS)
1 #include <cstring> 2 #include <
cstdio
> 3 #include <string> 4 #include <iostream
·
2015-11-11 10:04
sequence
POJ 2482 Stars in Your Window(线段树+扫描线)
1 #include <
cstdio
> 2 #include <cstring> 3 #include <string> 4 #include <
·
2015-11-11 10:02
window
TC SRM 583 DIV 2
1 #include <cstring> 2 #include <
cstdio
> 3 #include <string> 4
·
2015-11-11 10:01
div
POJ 2892 Tunnel Warfare(树状数组+二分)
1 #include <cstring> 2 #include <
cstdio
> 3 #include <string> 4 #include <
·
2015-11-11 10:00
树状数组
上一页
79
80
81
82
83
84
85
86
下一页
按字母分类:
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
其他