关闭

POJ 2318 Toys(判断点在直线的方向)

TOYS Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 16656 Accepted: 7994 DescriptionCalculate the number of toys that land in each bin of a partitioned toy box. Mom and dad...
阅读(2) 评论(0)

CF #443 C Short Program

C. Short Program time limit per test2 seconds memory limit per test256 megabytes inputstandard input outputstandard output Petya learned a new programming language CALPAS. A program in this langua...
阅读(8) 评论(0)

POJ 2437 Muddy Roads(贪心 最少固长线段覆盖区间)

Language: Muddy roads Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 3389 Accepted: 1557 DescriptionFarmer John has a problem: the dirt road from his farm to town has suffered...
阅读(21) 评论(0)

POJ 1328 Radar Installation(贪心——最少区间选点覆盖)

Radar Installation Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 93549 Accepted: 20884 DescriptionAssume the coasting is an infinite straight line. Land is in one side of co...
阅读(25) 评论(0)

HDU 2037 今年暑假不AC(贪心 最多不相交区间)

今年暑假不ACTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 62857 Accepted Submission(s): 33954Problem Description “今年暑假不AC?” “是的。” “那你干什么呢?”...
阅读(12) 评论(0)

HDU 1789 Doing Homework Again(贪心)

Doing Homework againTime Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 15450 Accepted Submission(s): 9013Problem Description Ignatius has just...
阅读(9) 评论(0)

HDU 1074 Doing Homework(状压dp+记录路径)

Doing HomeworkTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 10363 Accepted Submission(s): 4997Problem Description Ignatius has just come...
阅读(21) 评论(0)

HDU 1050 Moving Tables(贪心)

The famous ACM (Advanced Computer Maker) Company has rented a floor of a building whose shape is in the following figure. The floor has 200 rooms each on the north side and south side along the corrid...
阅读(25) 评论(0)

文章标题

Dining Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 19461 Accepted: 8670 DescriptionCows are such finicky eaters. Each cow has a preference for certain foods and drinks, an...
阅读(36) 评论(0)

UVA 796 Critical Links(Tarjan求无向图中的桥)

桥:割边,即去掉之后原本连通的分支不再连通 求法:和割点差不多 只要 dfn[i]小于low[j],则ij就是割边 注意这题的输出格式,格式错误导致的wa了好几次,gg…..输出格式只要复制就可以了啊……. 还要按第一个输出点升序排序。。。。In a computer network a link L, which interconnects two servers, is consider...
阅读(48) 评论(0)

UVA 315 Network(Tarjan求无向图割点)

割点:删除该点和相关边,原来的连通图能变得不连通的点 求法: 当节点i是根(搜索起点)时,只要它的孩子多于两个,那么它就是割点,不用考虑形成环的情况,因为在遍历另一个形成环的点的孩子时,就已经从第一个形成环的孩子遍历到了它当节点i不是根的时候,它的孩子是j,当dfn[i]>=low[j]时,就是割点,因为当dfn[i]#include #include #...
阅读(49) 评论(0)

HDU 1269 迷宫城堡(Tarjan or Kosaraju模板)

迷宫城堡Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 17917 Accepted Submission(s): 7852Problem Description 为了训练小希的方向感,Gardon建立了一座大城堡,里面有N个房间...
阅读(60) 评论(0)

POJ 1236(强连通分量+Kosaraju)

Limit: 1000MS Memory Limit: 10000K Total Submissions: 19625 Accepted: 7732 DescriptionA number of schools are connected to a computer network. Agreements have been developed among those s...
阅读(120) 评论(0)

HDU 5536(01字典树)

John is a manager of a CPU chip factory, the factory produces lots of chips everyday. To manage large amounts of products, every processor has a serial number. More specifically, the factory produces n...
阅读(68) 评论(0)

HDU 3336 Count the strings(KMP+DP)

It is well known that AekdyCoin is good at string problems as well as number theory problems. When given a string s, we can write down all the non-empty prefixes of this string. For example: s: “abab...
阅读(75) 评论(0)

HDU 1358 Peroid(KMP和循环节)

For each prefix of a given string S with N characters (each character has an ASCII code between 97 and 126, inclusive), we want to know whether the prefix is a periodic string. That is, for each i (2 <...
阅读(71) 评论(0)

HDU 3746 Cyclic Nacklace (KMP和循环节)

CC always becomes very depressed at the end of this month, he has checked his credit card yesterday, without any surprise, there are only 99.9 yuan left. he is too distressed and thinking about how to...
阅读(73) 评论(0)

HDU 2087 剪花布条(KMP查找不交叉区间的模式串个数)

一块花布条,里面有些图案,另有一块直接可用的小饰条,里面也有一些图案。对于给定的花布条和小饰条,计算一下能从花布条中尽可能剪出几块小饰条来呢? Input 输入中含有一些数据,分别是成对出现的花布条和小饰条,其布条都是用可见ASCII字符表示的,可见的ASCII字符有多少个,布条的花纹也有多少种花样。花纹条和小饰条不会超过1000个字符长。如果遇见#字符,则不再进行工作。 Output...
阅读(56) 评论(0)

HDU 1686 Oulipo (KMP查找可交叉区间模式串)

The French author Georges Perec (1936–1982) once wrote a book, La disparition, without the letter ‘e’. He was a member of the Oulipo group. A quote from the book: Tout avait Pair normal, mais tout s’af...
阅读(58) 评论(0)

HDU 1711 Number Sequence (KMP模板)

Given two sequences of numbers : a[1], a[2], …… , a[N], and b[1], b[2], …… , b[M] (1 <= M <= 10000, 1 <= N <= 1000000). Your task is to find a number K which make a[K] = b[1], a[K + 1] = b[2], …… , a[K...
阅读(46) 评论(0)
91条 共5页1 2 3 4 5 ... 下一页 尾页
    个人资料
    • 访问:6945次
    • 积分:933
    • 等级:
    • 排名:千里之外
    • 原创:90篇
    • 转载:0篇
    • 译文:1篇
    • 评论:0条