- 博客(15)
- 资源 (2)
- 收藏
- 关注
RSS订阅原创 [spfa+判负环]poj3259 Wormholes
Wormholes Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 44542 Accepted: 16390 Description While exploring his many farms, Farmer John has discovered a
2016-08-24 09:10:31
204
原创 [spfa/dijkstra]poj3268 Silver Cow Party
Silver Cow Party Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 18961 Accepted: 8655 Description One cow from each of N farms (1 ≤ N ≤ 1000) convenientl
2016-08-23 17:54:52
229
原创 [暴力搜索]poj1231 The Alphabet Game
The Alphabet Game Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 1442 Accepted: 586 Description Little Dara has recently learned how to write a few lett
2016-08-17 19:31:11
283
原创 [背包]poj1157 LITTLE SHOP OF FLOWERS
LITTLE SHOP OF FLOWERS Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 20753 Accepted: 9587 Description You want to arrange the window of your flower sho
2016-08-17 19:24:00
185
原创 [线段树]poj3667 Hotel（区间合并、更新、延迟/懒惰标记
Hotel Time Limit: 3000MS Memory Limit: 65536K Total Submissions: 16089 Accepted: 6998 Description The cows are journeying north to Thunder Bay in Canada to gain cul
2016-08-17 19:02:47
271
原创 [floyd]poj1125 Stockbroker Grapevine
Stockbroker Grapevine Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 34129 Accepted: 18867 Description Stockbrokers are known to overreact to rumours. Y
2016-08-17 18:58:17
220
原创 [线段树]hdu1698 Just a Hook（区间更新、延迟标记
Just a Hook Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 28346 Accepted Submission(s): 14047 Problem Description In the game
2016-08-15 22:39:57
284
原创 [DP]poj1018 Communication System
Communication System Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 26958 Accepted: 9612 Description We have received an order from Pizoor Communication
2016-08-15 22:34:06
220
原创 [模板]线段树的建树、查询、单点更新、区间更新
此线段树以求区间最小值为例，求区间和只需适当更改pushup()函数即可 建树 int arr[N]; int SetTree[N*4]; int pushup(int root) { return min(SetTree[root<<1], SetTree[root<<1|1]); } void build(int root, int left, int right) {
2016-08-15 22:00:40
262
原创 [模板]高精度加、减、乘
1、高精度加法 #include #include #include using namespace std; const int N = 10001; int main() { char sa[N], sb[N]; int a[N*2], b[N*2], c[N*2]; int la, lb, lc;//must lc < la+lb int i, j, t
2016-08-06 19:04:41
217
原创 [模板]广度优先搜索BFS
BFS（广度优先搜索）适用于节点多，搜索树不深的情况； 学习博客：http://blog.csdn.net/raphealguo/article/details/7523411 DFS（深度优先搜索）适用于节点少，搜索树深的情况； 学习博客：http://rapheal.iteye.com/blog/1526863 具体情况具体分析，贴一个BFS模板： #include #in
2016-08-06 18:50:30
348
原创 [状态压缩]poj3254 Corn Fields
A - Corn Fields Time Limit:2000MS Memory Limit:65536KB 64bit IO Format:%lld & %llu Submit Status Practice POJ 3254 Description Farmer John has purchased a lush new rectan
2016-08-05 13:26:34
479
原创 [状态压缩]poj1185 炮兵阵地
炮兵阵地 Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 25243 Accepted: 9748 Description 司令部的将军们打算在N*M的网格地图上部署他们的炮兵部队。一个N*M的地图由N行M列组成，地图的每一格可能是山地（用"H" 表示），也
2016-08-04 16:51:11
271
原创 [Floyd+状态压缩DP]poj3311 Hie with the Pie
Hie with the Pie Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 6539 Accepted: 3531 Description The Pizazz Pizzeria prides itself in delivering pizzas t
2016-08-03 14:31:39
263
原创 [模板]二进制状态压缩DP模板（详解
题目： 在 n*n(n≤20)的方格棋盘上放置 n 个车(可以攻击所在行、列)，求使它们不能互相攻击的方案总数。 思路： 根据组合数学很明显是n！（n的阶乘） 我们把二进制中的 1 看做放了一个车，0 作为不放； 整个模板我们以n = 5的5*5的矩阵为例子 ①开个for：1 to (1 为什么是(1 一开始for循环是一行一行找，找到最后每一列都有车，显然这就是我们要找的最终状态
2016-08-03 11:08:14
2800
sublime_text_3_build_3126_x64.tar.bz2
2018-01-20
KCauldron-Backport-1558-1.7.10-1558.201-bundle.zip
2018-01-20
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人