随笔分类 -  ACM题解

上一页 1 2 3 4 5 6 7 8 下一页

D. Colorful Graph(坑爹题)
摘要:D. Colorful Graphtime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou've got an undirected graph, consisting of n vertices and m edges. We will consider the graph's vertices numbered with integers from 1 to n. Each vertex of the graph has 阅读全文

posted @ 2013-03-18 19:40 铁树银花 阅读(389) 评论(0) 推荐(0) 编辑

Shaking Your Cellphone(并查集)
摘要:Shaking Your Cellphone Time Limit:1000MS Memory Limit:65535KB 64bit IO Format:%lld & %llu Submit Status Practice UESTC 1700Description Do you know a software called "WeiXin", a kind of chatting tool? There is an application called "Shaking for a while". Once you shake your ce 阅读全文

posted @ 2013-03-18 17:24 铁树银花 阅读(255) 评论(0) 推荐(0) 编辑

Codeforces Round #171 (Div. 2) B. Books(DP)
摘要:B. Bookstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputWhen Valera has got some free time, he goes to the library to read some books. Today he's got t free minutes to read. That's why Valera took n books in the library and for each book 阅读全文

posted @ 2013-03-12 16:27 铁树银花 阅读(602) 评论(0) 推荐(0) 编辑

Codeforces Round #171 (Div. 2) A. Point on Spiral(模拟)
摘要:A. Point on Spiraltime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputValera the horse lives on a plane. The Cartesian coordinate system is defined on this plane. Also an infinite spiral is painted on the plane. The spiral consists of segments: [(0,  阅读全文

posted @ 2013-03-10 11:49 铁树银花 阅读(393) 评论(0) 推荐(0) 编辑

Codeforces Round #170 (Div. 2) C. Learning Languages(并查集)
摘要:C. Learning Languagestime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputThe "BerCorp" company has got n employees. These employees can use m approved official languages for the formal correspondence. The languages are numbered with integer 阅读全文

posted @ 2013-03-09 09:50 铁树银花 阅读(243) 评论(0) 推荐(0) 编辑

免费馅饼(二维DP)
摘要:免费馅饼 Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64u Submit Status Practice HDU 1176Description都 说天上不会掉馅饼,但有一天gameboy正走在回家的小径上,忽然天上掉下大把大把的馅饼。说来gameboy的人品实在是太好了,这馅饼别处都不掉, 就掉落在他身旁的10米范围内。馅饼如果掉在了地上当然就不能吃了,所以gameboy马上卸下身上的背包去接。但由于小径两侧都不能站人,所以他只能在 小径上接。由于gameboy平时老呆在房间里玩游戏,虽然在游戏中 阅读全文

posted @ 2013-03-06 17:01 铁树银花 阅读(314) 评论(0) 推荐(0) 编辑

Max Sum(经典DP)
摘要:Max Sum Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64u Submit Status Practice HDU 1003DescriptionGiven a sequence a[1],a[2],a[3]......a[n], your job is to calculate the max sum of a sub-sequence. For example, given (6,-1,5,4,-7), the max sum in this sequence is 6 + (-1) + 5 阅读全文

posted @ 2013-03-03 13:29 铁树银花 阅读(3608) 评论(0) 推荐(0) 编辑

最大连续子序列(经典DP)
摘要:最大连续子序列 Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64u Submit Status Practice HDU 1231Description给定K个整数的序列{ N1, N2, ..., NK },其任意连续子序列可表示为{ Ni, Ni+1, ..., Nj },其中 1 <= i <= j <= K。最大连续子序列是所有连续子序列中元素和最大的一个, 例如给定序列{ -2, 11, -4, 13, -5, -2 },其最大连续子序列为{ 11, -4, 13 },最大 阅读全文

posted @ 2013-03-03 12:15 铁树银花 阅读(430) 评论(0) 推荐(0) 编辑

Codeforces Round #170 (Div. 2) B. New Problem(好题)
摘要:B. New Problemtime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputComing up with a new problem isn't as easy as many people think. Sometimes it is hard enough to name it. We'll consider a title original if it doesn't occur as a substring 阅读全文

posted @ 2013-03-02 21:42 铁树银花 阅读(344) 评论(0) 推荐(0) 编辑

Codeforces Round #169 (Div. 2) D. Little Girl and Maximum XOR(贪心,中等)
摘要:D. Little Girl and Maximum XORtime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputA little girl loves problems on bitwise operations very much. Here's one of them.You are given two integers l and r. Let's consider the values of for all pairs 阅读全文

posted @ 2013-03-02 12:16 铁树银花 阅读(331) 评论(0) 推荐(0) 编辑

Codeforces Round #169 (Div. 2) C. Little Girl and Maximum Sum(线段树区间更新)
摘要:C. Little Girl and Maximum Sumtime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputThe little girl loves the problems on array queries very much.One day she came across a rather well-known problem: you've got an array of n elements (the elements o 阅读全文

posted @ 2013-03-01 17:20 铁树银花 阅读(486) 评论(0) 推荐(0) 编辑

Codeforces Round #169 (Div. 2) B. Little Girl and Game(博弈)
摘要:B. Little Girl and Gametime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputThe Little Girl loves problems on games very much. Here's one of them.Two players have got a string s, consisting of lowercase English letters. They play a game that is de 阅读全文

posted @ 2013-02-26 23:45 铁树银花 阅读(667) 评论(0) 推荐(0) 编辑

Codeforces Round #167 (Div. 2) C. Dima and Staircase(线段树·成段更新,繁琐)
摘要:C. Dima and Staircasetime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputDima's got a staircase that consists of n stairs. The first stair is at height a1, the second one is at a2, the last one is at an (1 ≤ a1 ≤ a2 ≤ ... ≤ an).Dima decided to pl 阅读全文

posted @ 2013-02-26 16:17 铁树银花 阅读(462) 评论(0) 推荐(0) 编辑

Javabeans(递推)
摘要:JavabeansTime Limit: 2 Seconds Memory Limit: 65536 KBJavabeans are delicious. Javaman likes to eat javabeans very much.Javaman has n boxes of javabeans. There are exactly i javabeans in the i-th box (i = 1, 2, 3,...n). Everyday Javaman chooses an integer x. He also chooses several boxes where the... 阅读全文

posted @ 2013-02-25 17:43 铁树银花 阅读(397) 评论(0) 推荐(0) 编辑

Kagome Kagome(简单)
摘要:3492 - Kagome Kagome时间限制:Java: 2000 ms / Others: 2000 ms内存限制: Java: 65536 KB / Others: 65536 KB问题描述Kagome kagome, kago no naka no tori wa Itsu itsu deyaru? Yoake no ban ni Tsuru to kame to subetta. Ushiro no shoumen daare? Translation: Kagome kagome, the bird in the cage, when will you come out? In 阅读全文

posted @ 2013-02-25 17:38 铁树银花 阅读(930) 评论(0) 推荐(0) 编辑

Ordinal Numbers(简单)
摘要:Ordinal NumbersTime Limit: 2 Seconds Memory Limit: 65536 KBOrdinal numbers refer to a position in a series. Common ordinals include zeroth, first, second, third, fourth and so on. Ordinals are not often written in words, they are written using digits and letters. An ordinal indicator is a sign ad... 阅读全文

posted @ 2013-02-25 17:35 铁树银花 阅读(1642) 评论(0) 推荐(0) 编辑

Edge(简单)
摘要:Edge 时间限制(普通/Java):1000MS/10000MS 运行内存限制:65536KByte 总提交: 1 测试通过: 0 描述For products that are wrapped in small packings it is necessary that the sheet of paper containing the directions for use is folded until its size becomes small enough. We assume that a sheet of paper is rectangular ... 阅读全文

posted @ 2013-02-25 17:33 铁树银花 阅读(324) 评论(0) 推荐(0) 编辑

Conic Section(圆锥曲线基础)
摘要:Conic SectionTime Limit: 2 Seconds Memory Limit: 65536 KBThe conic sections are the nondegenerate curves generated by the intersections of a plane with one or two nappes of a cone. For a plane perpendicular to the axis of the cone, a circle is produced. For a plane that is not perpendicular to th... 阅读全文

posted @ 2013-02-25 17:31 铁树银花 阅读(1494) 评论(0) 推荐(0) 编辑

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

posted @ 2013-02-25 17:29 铁树银花 阅读(253) 评论(0) 推荐(0) 编辑

I Hate It(线段树基础)
摘要:I Hate ItTime Limit: 9000/3000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 22019Accepted Submission(s): 8792Problem Description很多学校流行一种比较的习惯。老师们很喜欢询问,从某某到某某当中,分数最高的是多少。这让很多学生很反感。不管你喜不喜欢,现在需要你做的是,就是按照老师的要求,写一个程序,模拟老师的询问。当然,老师有时候需要更新某位同学的成绩。Input本题目包含多组测试,请处理到文件结束。在每个 阅读全文

posted @ 2013-02-25 17:27 铁树银花 阅读(243) 评论(0) 推荐(0) 编辑

上一页 1 2 3 4 5 6 7 8 下一页

导航