摘要：Increasing Speed LimitsTime Limit: 2000/10000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 101 Accepted Submission(s): 46 Problem Description You were driving along a highway when you got caught by the road police for speeding. It turns out that the... 阅读全文

摘要：IntervieweTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 528 Accepted Submission(s): 134 Problem Description YaoYao has a company and he wants to employ m people recently. Since his company is so famous, there are n people coming... 阅读全文

摘要：See you~Time Limit: 5000/3000 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 144 Accepted Submission(s): 47 Problem Description Now I am leaving hust acm. In the past two and half years, I learned so many knowledge about Algorithm and Programming, and... 阅读全文

摘要：畅通工程Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 104 Accepted Submission(s): 86 Problem Description 某省调查城镇交通状况，得到现有城镇道路统计表，表中列出了每条道路直接连通的城镇。省政府“畅通工程”的目标是使全省任何两个城镇间都可以实现交通（但不一定有直接的道路相连，只要互相间接通过道路可达即可）。问最少还需要建设多少条道路？ In... 阅读全文

摘要：Cow SortingTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 67 Accepted Submission(s): 35 Problem Description Sherlock's N (1 ≤ N ≤ 100,000) cows are lined up to be milked in the evening. Each cow has a unique "grumpiness" level in... 阅读全文

摘要：敌兵布阵Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 199 Accepted Submission(s): 123 Problem Description C国的死对头A国这段时间正在进行军事演习，所以C国间谍头子Derek和他手下Tidy又开始忙乎了。A国在海岸线沿直线布置了N个工兵营地,Derek和Tidy的任务就是要监视这些工兵营地的活动情况。由于采取了某种先进的监测手段，所以每个工兵营地的人数C国... 阅读全文

摘要：【2012四川省选】喵星球上的点名时间限制: 2000 ms 内存限制: 131072 KB【题目描述】a180285幸运地被选做了地球到喵星球的留学生。他发现喵星人在上课前的点名现象非常有趣。 假设课堂上有N个喵星人，每个喵星人的名字由姓和名构成。喵星球上的老师会选择M个串来点名，每次读出一个串的时候，如果这个串是一个喵星人的姓或名的子串，那么这个喵星人就必须答到。 然而，由于喵星人的字码过于古怪，以至于不能用ASCII码来表示。为了方便描述，a180285决定用数串来表示喵星人的名字。 现在你能帮助a180285统计每次点名的时候有多少喵星人答到，以及M次点名结束后每个喵星人答到多少次.. 阅读全文

摘要：Milk PatternsTime Limit: 5000MSMemory Limit: 65536KTotal Submissions: 7337Accepted: 3331Case Time Limit: 2000MSDescriptionFarmer John has noticed that the quality of milk given by his cows varies from day to day. On further investigation, he discovered that although he can't predict the quality 阅读全文

摘要：Long Long MessageTime Limit: 4000MSMemory Limit: 131072KTotal Submissions: 16819Accepted: 6828Case Time Limit: 1000MSDescriptionThe little cat is majoring in physics in the capital of Byterland. A piece of sad news comes to him these days: his mother is getting ill. Being worried about spending so m 阅读全文

摘要：Musical ThemeTime Limit: 1000MSMemory Limit: 30000KTotal Submissions: 13852Accepted: 4810DescriptionA musical melody is represented as a sequence of N (1<=N<=20000)notes that are integers in the range 1..88, each representing a key on the piano. It is unfortunate but true that this representat 阅读全文

摘要：首先吐槽一句：大神就是大神，写的东西我理解了三个月终于沾到边了！进入正题：http://wenku.baidu.com/view/ed1be61e10a6f524ccbf85fd.html建议跟pdf一起看上图是后缀数组具体怎么存储的（主要笔记就是关于倍增算法的）先看一看程序：这一段是对长度为1的字符串进行排序，论文上写的很清楚，自己划划就知道了接下来：第一句话： y[p++]=i; 想一想，此时我们考虑这个字符串i的值为8，那么也就是说i+j的r值（r[i+j]）永远小于0-8中的任何数！那么毫无疑问这个y值是最小的，所以可以直接排在前面对于y数组的理解，我是这么想的：y[i]表示排名为i的 阅读全文

摘要：1031: [JSOI2007]字符加密CipherTime Limit: 10 SecMemory Limit: 162 MBSubmit: 1379Solved: 529[Submit][Status][Discuss]Description喜欢钻研问题的JS 同学，最近又迷上了对加密方法的思考。一天，他突然想出了一种他认为是终极的加密办法：把需要加密的信息排成一圈，显然，它们有很多种不同的读法。例如下图，可以读作：JSOI07SOI07JOI07JSI07JSO07JSOI7JSOI0把它们按照字符串的大小排序：07JSOI7JSOI0I07JSOJSOI07OI07JSSOI07J读出 阅读全文