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)

导航