Tabris的博客

题目连接 : 传送阵———————————————-. Colored Sticks Time Limit: 5000MS Memory Limit: 128000K Total Submissions: 35437 Accepted: 9287 DescriptionYou are given a bunch of wooden sticks. Each endpo

题目连接:http://www.spoj.com/problems/KAOS/ 基本都是借（chao）鉴(xi)WannaflyUnion——————————————————. KAOS - KaoskaosLittle Lovro likes to play games with words. During the last few weeks he realized that some wo

题目连接：http://acm.hdu.edu.cn/showproblem.php?pid=4825 ————————————————————————————. Xor SumTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 132768/132768 K (Java/Others) Total Submission(s): 18

题目链接：http://www.spoj.com/problems/STC02/ —————————————————————————————–. STC02 - Antisymmetry no tags Byteasar studies certain strings of zeroes and ones. Let S be such a string. By Sr we will den

题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=3068———————————————————. 最长回文Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 18924 Accepted

题目连接：http://www.51nod.com/contest/problem.html#!problemId=1601——————————————————————————. 完全图的最小生成树计数 SkyDec (命题人) 基准时间限制：1 秒 空间限制：131072 KB 分值: 160给定一个长度为n的数组a[1..n]，有一幅完全图，满足(u,v)的边权为a[u] xor a[v

经过BNUCPC，发现KMP完全不会了，于是找几个水KMP/NEXT题 压压惊。VJ链接：https://cn.vjudge.net/contest/151711#overviewA POJ 3461 Oulipo———————————————————————————————————————————— 问你A字符串在B字符串中出现了几次，只要在KMP 的过程中记录匹配到子串尾的次数就好了B

题目链接：http://acm.hzau.edu.cn/problem.php?id=1206 —————————————————————————————————————— 1206: MathematicalGame Time Limit: 2 Sec Memory Limit: 1280 MB Submit: 170 Solved: 26 [Submit][Status][Web

题目链接:http://acm.hrbust.edu.cn/index.php?m=ProblemSet&a=showProblem&problem_id=1681 ————————————————————————————————————————————回文串 Time Limit: 1000 MS Memory Limit: 32768 K Total Submit: 121(25 user