2013年5月8日

SOJ 1041: Pipe

摘要: The GX Light Pipeline Company started to prepare bent pipes for the new transgalactic light pipeline. During the design phase of the new pipe shape the company ran into the problem of determining how far the light can reach inside each component of the pipe. Note that the material which the pipe is 阅读全文

posted @ 2013-05-08 15:09 ShellNET 阅读(152) 评论(1) 推荐(0)

2013年4月10日

2013ACM多校联合(1)_CSUST_拯救猫咪

摘要: Description菱菱平时生活非常勤俭,从来只吃外卖不吃食堂。某日,好心的菱菱收养了一只流浪猫,但是猫咪对菱菱糟糕的伙食状况非常不满,屡次想要偷吃菱菱的鸟改善生活。于是菱菱想到放猫咪去食堂蹭饭,但是去食堂的路上有许多凶悍的野狗巡逻把守,直接去恐怕有来无回,当然这也难不倒聪明的菱菱,菱菱给猫咪做了一个外面画着老虎的盒子。这样猫咪可以在野狗经过的时候趴下休息,用盒子把自己保护起来。待危险解除后继续前行。同时由于经过了充分的休息,可以获得一定的能量点数,猫咪可以选择进行一次长达数米的跳跃。现在菱菱想知道猫咪最少需要多长时间可以到达食堂。开始时,猫咪在坐标 0 点出发,初始能量为 0 ,食堂的坐标 阅读全文

posted @ 2013-04-10 15:07 ShellNET 阅读(212) 评论(0) 推荐(0)

2013年3月31日

SOJ 2494: Appleland

摘要: DescriptionLong long ago, there was a country named Appleland. Appleland was consisted of N cities, some were connected by road, and all the roads were one way.One day, the king of Appleland decided to set up K police station(s) in some city. The K police station(s) should satisfy the following cond 阅读全文

posted @ 2013-03-31 01:42 ShellNET 阅读(213) 评论(0) 推荐(0)

SOJ 2440: The days in fzk

摘要: 问题描述fzk这几天时而郁闷,时而很high,他开始有点讨厌这样毫无规律的生活了,于是他开始为将来的日子作计划!他首先对自己的将来的 n天的心情作了一个预测,但是他对自己的预测也不是很有把握,fzk说,我最多可能连续R天预测准确,最多可能连续W天预测失误。fzk希望在自己心情很high的日子里作某些事情,你能够算出他在这n天中最多可能high多少天么?输入描述首先输入测试数据的组数t (1 <= t <= 100),然后每组数据描述如下:首先是两个整数R和W,其中(1 <= R <= 50, 1 <= W <= 50)然后是一个代表他对自己的心情的预测的字符 阅读全文

posted @ 2013-03-31 01:16 ShellNET 阅读(195) 评论(0) 推荐(0)

SOJ 2722: Treats for the Cows

摘要: DescriptionFJ has purchased N (1 <= N <= 2000) yummy treats for the cows who get money for giving vast amounts of milk. FJ sells one treat per day and wants to maximize the money he receives over a given period time. The treats are interesting for many reasons:The treats are numbered 1..N and 阅读全文

posted @ 2013-03-31 01:03 ShellNET 阅读(309) 评论(0) 推荐(0)

2013年3月30日

SOJ 2775: Breaking Strings

摘要: SOJ 2775: Breaking StringsDescriptionA certain string-processing language allows the programmer to break a string into two pieces. Since this involves copying the old string,it costs n units of time to break a string of n characters into two pieces. Suppose a programmer wants to break a string into 阅读全文

posted @ 2013-03-30 16:44 ShellNET 阅读(390) 评论(0) 推荐(0)

SOJ题目分类

摘要: SOJ题目分类,转自蓝色星空作者:onmylove-----------------------------最优化问题------------------------------------- ----------------------常规动态规划 SOJ1162 I-Keyboard SOJ1685 Chopsticks SOJ1679 Gangsters SOJ2096 Maximum Submatrix SOJ2111 littleken bg SOJ2142 Cow Exhibition SOJ2505 The County Fair SOJ2818 QQ音速 S... 阅读全文

posted @ 2013-03-30 16:41 ShellNET 阅读(222) 评论(0) 推荐(0)

导航