数据结构
文章平均质量分 79
cmonkey
追随大自然的召唤
展开
-
POJ 2503 Babelfish
Babelfish Time Limit: 3000MS Memory Limit: 65536K Total Submissions: 22142 Accepted: 9474 Description You have just moved from Waterloo to a big city. The people here speak an incomprehensib原创 2012-02-03 22:47:57 · 407 阅读 · 0 评论 -
POJ 3274 Gold Balanced Lineup
Gold Balanced Lineup Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 7600 Accepted: 2245 Description Farmer John's N cows (1 ≤ N ≤ 100,000) share many similarities. In fact, FJ ha原创 2012-02-03 22:49:51 · 421 阅读 · 0 评论 -
HDU 3872 Dragon Ball
Dragon Ball Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 65768/32768 K (Java/Others) Total Submission(s): 113 Accepted Submission(s): 45 Problem Description There are N "dragon balls"原创 2011-08-02 09:19:58 · 931 阅读 · 0 评论 -
POJ3693 Maximum repetition substring 后缀数组
Maximum repetition substring Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 4671 Accepted: 1381 Description The repetition number of a string is defined as the maximum number R原创 2012-10-19 23:35:39 · 801 阅读 · 0 评论 -
2014 微软 编程之美 初赛 第一场 题解
2014 微软 编程之美 初赛 第一场 题解 趁热火写个题解.这场一共才三题. 第一题 焦距 这...大致就是给你公式照着敲,处理好字符串就行,自认为代码写的蛮干净的~~ 第二题 树 这是最难的一题,但是大数据太弱了,竟然都暴过了... 题意:N(1e5)个点的树,初始点权都为0,有Q(1e5)个操作,每次操作在以u为根的子树中,对深度(根的深度为1)在区间[l,r]内原创 2014-04-19 22:58:17 · 939 阅读 · 1 评论