09 2015 档案

codeforces#321(div2) E. Kefa and Watch
摘要：codeforces#321(div2) E. Kefa and Watchtime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputOne day Kef... 阅读全文
posted @ 2015-09-24 19:20 __560 阅读(361) 评论(0) 推荐(0)
codeforces round #321 (div2)
摘要：codeforces#321(div2)A题：水题。#include#define REP(i,a,b) for(int i=a;i>n){ REP(i,1,n) scanf("%I64d",&a[i]); int ans=1,now=1; REP(i,2,... 阅读全文
posted @ 2015-09-23 03:44 __560 阅读(231) 评论(0) 推荐(0)
AC自动机专题
摘要：AC自动机专题先开个坑按照惯例，先来模板就以hdu2222的代码作为模板吧，就是在字典树上连上一些失配边，这个模板将不存在的子结点直接当成失配边连到根，对所有的转移都一视同仁。失配时候的转移和kmp是一样的道理，只是kmp是在链上转移，而自动机是在树上转移。#include#include#incl... 阅读全文
posted @ 2015-09-22 21:14 __560 阅读(218) 评论(0) 推荐(0)
9月22号~25号
摘要：AC自动机 --> splay --> LCT --> 博弈论 --> 常见数学 阅读全文
posted @ 2015-09-22 21:12 __560 阅读(197) 评论(0) 推荐(0)
2015沈阳网络赛1003 Minimum Cut 树链剖分 数组维护前缀和进行区间增减
摘要：2015沈阳网络赛1003 Minimum Cut 树链剖分 数组维护前缀和进行区间增减Minimum CutTime Limit: 3000/2000 MS (Java/Others)Memory Limit: 65535/102400 K (Java/Others)Total Submissi... 阅读全文
posted @ 2015-09-19 19:14 __560 阅读(549) 评论(5) 推荐(0)
codeforces#320(div2) E. Weakness and Poorness 三分
摘要：codeforces#320(div2) E. Weakness and Poorness 三分E. Weakness and Poornesstime limit per test2 secondsmemory limit per test256 megabytesinputstandard in... 阅读全文
posted @ 2015-09-17 04:10 __560 阅读(434) 评论(0) 推荐(0)
codeforces#320(div2) D "Or" Game 贪心
摘要：codeforces#320(div2) D "Or" Game 贪心D. "Or" Gametime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputY... 阅读全文
posted @ 2015-09-17 02:57 __560 阅读(505) 评论(0) 推荐(0)
codeforces#320(div2) C A Problem about Polyline 二分
摘要：codeforces#320(div2) C A Problem about Polyline 二分C. A Problem about Polylinetime limit per test1 secondmemory limit per test256 megabytesinputstandar... 阅读全文
posted @ 2015-09-17 02:45 __560 阅读(385) 评论(0) 推荐(0)
xdoj1012 字符串哈希
摘要：xdoj1012 字符串哈希1012: 重复序列时间限制:1 Sec内存限制:128 MB提交:149解决:15[提交][状态][讨论版]题目描述为了让密码变得更长，fpcsong在密码的末端增加了一些无意义内容。为了能够记住密码，增加的内容往往是重复序列。例如下列密码xduacm2015_mima... 阅读全文
posted @ 2015-09-15 13:46 __560 阅读(364) 评论(0) 推荐(0)
2015长春网络赛总结
摘要：2015长春网络赛总结1007：签到题，区间最值查询，暴力或线段树或者ST都行。#include#include#include#include#include#define RI(a) scanf("%d",&(a))#define REP(i,a,b) for(int i=a;i>1; b... 阅读全文
posted @ 2015-09-14 20:14 __560 阅读(348) 评论(0) 推荐(0)
HDU5029 Relief grain 树链剖分+线段树离线
摘要：HDU5029 Relief grain 树链剖分+线段树离线Relief grainTime Limit: 10000/5000 MS (Java/Others)Memory Limit: 100000/100000 K (Java/Others)Total Submission(s): 1715... 阅读全文
posted @ 2015-09-10 13:54 __560 阅读(260) 评论(0) 推荐(0)
hdu4277 暴力
摘要：hdu4277 暴力USACO ORZTime Limit : 5000/1500ms (Java/Other)Memory Limit : 32768/32768K (Java/Other)Total Submission(s) : 4Accepted Submission(s) : 2Prob... 阅读全文
posted @ 2015-09-04 19:48 __560 阅读(363) 评论(0) 推荐(0)
hdu4271 Find Black Hand 2012长春网络赛E题 最短编辑距离
摘要：hdu4271 Find Black Hand 2012长春网络赛E题 最短编辑距离Find Black HandTime Limit : 5000/2000ms (Java/Other)Memory Limit : 32768/32768K (Java/Other)Total Submission... 阅读全文
posted @ 2015-09-04 15:28 __560 阅读(286) 评论(0) 推荐(0)
poj3356 字符串的最小编辑距离 dp
摘要：poj3356 字符串的最小编辑距离 dpAGTCTime Limit:1000MSMemory Limit:65536KTotal Submissions:10895Accepted:4188DescriptionLetxandybe two strings over some finite al... 阅读全文
posted @ 2015-09-04 04:16 __560 阅读(246) 评论(0) 推荐(0)
HDU4267 A Simple Problem with Integers 线段树/树状数组
摘要：HDU4267 A Simple Problem with Integers 线段树/树状数组2012长春网络赛A题Problem DescriptionLet A1, A2, ... , AN be N elements. You need to deal with two kinds of op... 阅读全文
posted @ 2015-09-03 21:08 __560 阅读(214) 评论(0) 推荐(0)
树链剖分 模版
摘要：树链剖分 模版#include#define lson l,m,rt G[maxn];int dep[maxn],son[maxn],fa[maxn],siz[maxn];int top[maxn];int id[maxn];int num;int val[maxn];struct Tree{ ... 阅读全文
posted @ 2015-09-01 23:25 __560 阅读(263) 评论(0) 推荐(0)
SPOJ375 Query on a tree 树链剖分
摘要：SPOJ375 Query on a tree 树链剖分no tagsYou are given a tree (an acyclic undirected connected graph) withNnodes, and edges numbered 1, 2, 3...N-1.We will ... 阅读全文
posted @ 2015-09-01 23:19 __560 阅读(246) 评论(0) 推荐(0)