10 2016 档案

Count Color
摘要：Count Color Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 43773 Accepted: 13249 Description Chosen Problem Solving and Program design as 阅读全文
posted @ 2016-10-31 21:32 勿忘初心0924 阅读(230) 评论(0) 推荐(0) 编辑
Just a Hook（区间set）
摘要：Just a Hook Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 29106 Accepted Submission(s): 14396 P 阅读全文
posted @ 2016-10-31 10:54 勿忘初心0924 阅读(196) 评论(0) 推荐(0) 编辑
A Simple Problem with Integers
摘要：A Simple Problem with Integers Time Limit: 5000MS Memory Limit: 131072K Total Submissions: 99895 Accepted: 31162 Case Time Limit: 2000MS Description Y 阅读全文
posted @ 2016-10-30 21:59 勿忘初心0924 阅读(151) 评论(0) 推荐(0) 编辑
Buy Tickets
摘要：Buy Tickets Time Limit: 4000MS Memory Limit: 65536K Total Submissions: 18936 Accepted: 9401 Description Railway tickets were difficult to buy around t 阅读全文
posted @ 2016-10-29 00:05 勿忘初心0924 阅读(238) 评论(0) 推荐(0) 编辑
Billboard
摘要：Billboard Time Limit: 20000/8000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 20145 Accepted Submission(s): 8391 Pro 阅读全文
posted @ 2016-10-28 21:09 勿忘初心0924 阅读(410) 评论(0) 推荐(0) 编辑
I Hate It
摘要：I Hate It Time Limit: 9000/3000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 67140 Accepted Submission(s): 26122 Pro 阅读全文
posted @ 2016-10-28 19:57 勿忘初心0924 阅读(148) 评论(0) 推荐(0) 编辑
敌兵布阵
摘要：敌兵布阵 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 79629 Accepted Submission(s): 33691 Problem 阅读全文
posted @ 2016-10-28 19:45 勿忘初心0924 阅读(262) 评论(0) 推荐(0) 编辑
Shortest Prefixes
摘要：Shortest Prefixes Time Limit: 1000MS Memory Limit: 30000K Total Submissions: 17715 Accepted: 7698 Description A prefix of a string is a substring star 阅读全文
posted @ 2016-10-28 17:04 勿忘初心0924 阅读(359) 评论(0) 推荐(0) 编辑
Babelfish
摘要：Babelfish Time Limit: 3000MS Memory Limit: 65536K Total Submissions: 41654 Accepted: 17670 Description You have just moved from Waterloo to a big city 阅读全文
posted @ 2016-10-28 16:35 勿忘初心0924 阅读(673) 评论(0) 推荐(0) 编辑
Hat’s Words
摘要：Hat’s Words Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 13798 Accepted Submission(s): 4950 Pr 阅读全文
posted @ 2016-10-28 00:12 勿忘初心0924 阅读(575) 评论(0) 推荐(0) 编辑
Phone List
摘要：Phone List Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 18386 Accepted Submission(s): 6192 Pro 阅读全文
posted @ 2016-10-27 23:29 勿忘初心0924 阅读(989) 评论(0) 推荐(0) 编辑
统计难题
摘要：统计难题 Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 131070/65535 K (Java/Others)Total Submission(s): 35487 Accepted Submission(s): 13270 Problem 阅读全文
posted @ 2016-10-27 21:44 勿忘初心0924 阅读(237) 评论(0) 推荐(0) 编辑
Mr. Frog’s Game
摘要：Mr. Frog’s Game Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 312 Accepted Submission(s): 209 P 阅读全文
posted @ 2016-10-27 19:49 勿忘初心0924 阅读(398) 评论(0) 推荐(0) 编辑
Basic Data Structure
摘要：Basic Data Structure Time Limit: 7000/3500 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 982 Accepted Submission(s): 阅读全文
posted @ 2016-10-27 18:44 勿忘初心0924 阅读(602) 评论(0) 推荐(0) 编辑
A strange lift
摘要：A strange lift Problem Description There is a strange lift.The lift can stop can at every floor as you want, and there is a number Ki(0 <= Ki <= N) on 阅读全文
posted @ 2016-10-25 23:36 勿忘初心0924 阅读(931) 评论(0) 推荐(0) 编辑
胜利大逃亡
摘要：胜利大逃亡 Problem Description Ignatius被魔王抓走了,有一天魔王出差去了,这可是Ignatius逃亡的好机会.魔王住在一个城堡里,城堡是一个A*B*C的立方体,可以被表示成A个B*C的矩阵,刚开始Ignatius被关在(0,0,0)的位置,离开城堡的门在(A-1,B-1, 阅读全文
posted @ 2016-10-25 16:56 勿忘初心0924 阅读(169) 评论(0) 推荐(0) 编辑
Rescue
摘要：Rescue Problem Description Angel was caught by the MOLIGPY! He was put in prison by Moligpy. The prison is described as a N * M (N, M <= 200) matrix. 阅读全文
posted @ 2016-10-25 15:35 勿忘初心0924 阅读(263) 评论(0) 推荐(0) 编辑
Turn the corner
摘要：Turn the corner Problem Description Mr. West bought a new car! So he is travelling around the city.One day he comes to a vertical corner. The street h 阅读全文
posted @ 2016-10-25 13:53 勿忘初心0924 阅读(311) 评论(0) 推荐(0) 编辑
find the nth digit
摘要：find the nth digit Problem Description 假设：S1 = 1S2 = 12S3 = 123S4 = 1234.........S9 = 123456789S10 = 1234567891S11 = 12345678912............S18 = 1234 阅读全文
posted @ 2016-10-25 00:04 勿忘初心0924 阅读(366) 评论(0) 推荐(0) 编辑
Cup
摘要：Cup Problem Description The WHU ACM Team has a big cup, with which every member drinks water. Now, we know the volume of the water in the cup, can you 阅读全文
posted @ 2016-10-24 23:18 勿忘初心0924 阅读(232) 评论(0) 推荐(0) 编辑
Can you find it?
摘要：Can you find it? Problem Description Give you three sequences of numbers A, B, C, then we give you a number X. Now you need to calculate if you can fi 阅读全文
posted @ 2016-10-24 21:18 勿忘初心0924 阅读(713) 评论(0) 推荐(0) 编辑
Strange fuction
摘要：Strange fuction Problem Description Now, here is a fuction: F(x) = 6 * x^7+8*x^6+7*x^3+5*x^2-y*x (0 <= x <=100)Can you find the minimum value when x i 阅读全文
posted @ 2016-10-24 20:17 勿忘初心0924 阅读(271) 评论(0) 推荐(0) 编辑
Can you solve this equation?
摘要：Can you solve this equation? Problem Description Now,given the equation 8*x^4 + 7*x^3 + 2*x^2 + 3*x + 6 == Y,can you find its solution between 0 and 1 阅读全文
posted @ 2016-10-24 20:07 勿忘初心0924 阅读(232) 评论(0) 推荐(0) 编辑
HDU 3732 Ahui Writes Word
摘要：Ahui Writes Word Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2856 Accepted Submission(s): 101 阅读全文
posted @ 2016-10-24 19:36 勿忘初心0924 阅读(209) 评论(0) 推荐(0) 编辑
2016-2017 ACM-ICPC, NEERC, Southern Subregional Contest H. Delete Them
摘要：H. Delete Them time limit per test 2 seconds memory limit per test 512 megabytes input standard input output standard output H. Delete Them time limit 阅读全文
posted @ 2016-10-23 21:33 勿忘初心0924 阅读(328) 评论(0) 推荐(0) 编辑
2016-2017 ACM-ICPC, NEERC, Southern Subregional Contest J. Bottles
摘要：J. Bottles time limit per test 2 seconds memory limit per test 512 megabytes input standard input output standard output J. Bottles time limit per tes 阅读全文
posted @ 2016-10-23 21:31 勿忘初心0924 阅读(264) 评论(0) 推荐(0) 编辑
数据结构--KMP算法总结
摘要：数据结构—KMP KMP算法用于解决两个字符串匹配的问题，但更多的时候用到的是next数组的含义，用到next数组的时候，大多是题目跟前后缀有关的 。 首先介绍KMP算法：（假定next数组已经学会，后边next数组会在介绍） 上图T为主链，P为模板链，要求P在T中是否出现，出现就返回位置。 朴素算 阅读全文
posted @ 2016-10-21 22:15 勿忘初心0924 阅读(4713) 评论(0) 推荐(2) 编辑
Power Strings（KMP）
摘要：Power Strings Time Limit: 3000MS Memory Limit: 65536K Total Submissions: 45008 Accepted: 18794 Description Given two strings a and b we define a*b to 阅读全文
posted @ 2016-10-19 19:00 勿忘初心0924 阅读(698) 评论(0) 推荐(0) 编辑
KMP (next数组的性质及证明)
摘要：性质：如果len%（len-next[len-1]）==0，则字符串中必存在最小循环节，且循环次数即为len/（len-next[len-1]）; 证明：在前len个字符组成的字符串，存在最小循环节k，那么next[len-1]=len-k;（为什么呐？因为next数组的定义就是最大前后缀相同的子串 阅读全文
posted @ 2016-10-19 15:36 勿忘初心0924 阅读(1004) 评论(0) 推荐(0) 编辑
KMP模板
摘要：#include using namespace std; /*************************KMP模板****************************/ int f[101];//优化后的失配指针,记住这里f要比P多一位,因为P到m-1即可,但是f还要计算出m的失配指针 int f2[101];//f2用来保存KM指针，是为优化f的失配指针,f保存的是优化之后的失配... 阅读全文
posted @ 2016-10-18 22:04 勿忘初心0924 阅读(196) 评论(0) 推荐(0) 编辑
poj 3461 Oulipo（KMP模板题）
摘要：Oulipo Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 36903 Accepted: 14898 Description The French author Georges Perec (1936–1982) once w 阅读全文
posted @ 2016-10-18 19:08 勿忘初心0924 阅读(246) 评论(0) 推荐(0) 编辑
线段树总结
摘要：线段树总结 ——这个周末训练赛和codeforces，加上自己有点偷懒导致进度严重推迟 线段树，顾名思义是在树上的线段，通过建树来维护你需要的操作，基本的操作有：区间求和，区间求最值，区间异或（这个实际上和区间更新差不多，就是加上值这个操作换成了异或），区间覆盖，扫描线求面积，线段树求区间连续字段。 阅读全文
posted @ 2016-10-18 00:26 勿忘初心0924 阅读(1527) 评论(0) 推荐(0) 编辑
Codeforces 376C. Socks
摘要：C. Socks time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output C. Socks time limit per test 2 阅读全文
posted @ 2016-10-16 21:30 勿忘初心0924 阅读(437) 评论(0) 推荐(0) 编辑
Codeforces 376B. Coupons and Discounts
摘要：B. Coupons and Discounts time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output B. Coupons and D 阅读全文
posted @ 2016-10-16 20:37 勿忘初心0924 阅读(283) 评论(0) 推荐(0) 编辑
Codeforces 376A. Night at the Museum
摘要：A. Night at the Museum time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output A. Night at the Mu 阅读全文
posted @ 2016-10-16 20:19 勿忘初心0924 阅读(312) 评论(0) 推荐(0) 编辑
Assigning Workstations
摘要：题目链接：http://vjudge.net/contest/127404#problem/A 阅读全文
posted @ 2016-10-16 10:21 勿忘初心0924 阅读(335) 评论(0) 推荐(0) 编辑
树的直径证明
摘要：树的直径又称树上最长的路，结论为从某一点搜出最长的路径一定是s或t点，再用一次搜索就会找出树的直径 只要运用的就是反证法。 现在假设s到t是树的直径。 取某一点u，搜到的最远点为x； 1. u在s-t路径上： 如果u在直径上，那么下一步肯定会搜到直径的某点，（如果，不是直径的某点的话，那么，dis( 阅读全文
posted @ 2016-10-10 10:33 勿忘初心0924 阅读(288) 评论(0) 推荐(0) 编辑
Frogger
摘要：Frogger Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 38575 Accepted: 12424 Description Freddy Frog is sitting on a stone in the middle o 阅读全文
posted @ 2016-10-09 15:39 勿忘初心0924 阅读(154) 评论(0) 推荐(0) 编辑
Circle
摘要：Circle Memory Limit: 32768KB 64bit IO Format: %lld & %llu Status Description Your task is so easy. I will give you an undirected graph, and you just n 阅读全文
posted @ 2016-10-07 16:55 勿忘初心0924 阅读(188) 评论(0) 推荐(0) 编辑
HDU 1022 Train Problem I
摘要：Train Problem I Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 32387 Accepted Submission(s): 122 阅读全文
posted @ 2016-10-07 15:57 勿忘初心0924 阅读(269) 评论(0) 推荐(0) 编辑
Argus
摘要：A data stream is a real-time, continuous, ordered sequence of items. Some examples include sensor data, Internet traffic, financial tickers, on-line auct 阅读全文
posted @ 2016-10-07 14:45 勿忘初心0924 阅读(623) 评论(0) 推荐(0) 编辑