时拉比-CSDN博客

原创 HDU - 1003

HDU - 1003Given 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 + 4 = 14.InputThe first line of the input contains an integer T(1<

2021-08-04 15:56:34 86

原创 POJ - 2376 贪心

Cleaning ShiftsFarmer John is assigning some of his N (1 <= N <= 25,000) cows to do some cleaning chores around the barn. He always wants to have one cow working on cleaning things up and has divided the day into T shifts (1 <= T <= 1,000,000)

2021-08-01 15:52:46 62

原创 UVA - 10099

The Tourist GuideMr. G. works as a tourist guide. His current assignment is to take some tourists from one city toanother. Some two-way roads connect the cities. For each pair of neighboring cities there is a busservice that runs only between those two

2021-08-01 15:19:20 109

原创 HDU - 1281棋盘游戏

棋盘游戏小希和Gardon在玩一个游戏：对一个N*M的棋盘，在格子里放尽量多的一些国际象棋里面的“车”，并且使得他们不能互相攻击，这当然很简单，但是Gardon限制了只有某些格子才可以放，小希还是很轻松的解决了这个问题（见下图）注意不能放车的地方不影响车的互相攻击。所以现在Gardon想让小希来解决一个更难的问题，在保证尽量多的“车”的前提下，棋盘里有些格子是可以避开的，也就是说，不在这些格子上放车，也可以保证尽量多的“车”被放下。但是某些格子若不放子，就无法保证放尽量多的“车”，这样的格子被称做重要点

2021-08-01 14:43:17 73

原创 HDU - 1272- 小希的迷宫

小希的迷宫上次Gardon的迷宫城堡小希玩了很久（见Problem B），现在她也想设计一个迷宫让Gardon来走。但是她设计迷宫的思路不一样，首先她认为所有的通道都应该是双向连通的，就是说如果有一个通道连通了房间A和B，那么既可以通过它从房间A走到房间B，也可以通过它从房间B走到房间A，为了提高难度，小希希望任意两个房间有且仅有一条路径可以相通（除非走了回头路）。小希现在把她的设计图给你，让你帮忙判断她的设计图是否符合她的设计思路。比如下面的例子，前两个是符合条件的，但是最后一个却有两种方法从5到达8。

2021-08-01 14:19:58 108

原创 LightOJ - 1282

标题题目You are given two integers: n and k, your task is to find the most significant three digits, and least significant three digits of nk.*Input*Input starts with an integer T (≤ 1000), denoting the number of test cases.Each case starts with a line

2021-08-01 13:09:03 103

原创非常可乐 HDU - 1495

非常可乐大家一定觉的运动以后喝可乐是一件很惬意的事情，但是seeyou却不这么认为。因为每次当seeyou买了可乐以后，阿牛就要求和seeyou一起分享这一瓶可乐，而且一定要喝的和seeyou一样多。但seeyou的手中只有两个杯子，它们的容量分别是N 毫升和M 毫升可乐的体积为S （S<101）毫升　(正好装满一瓶) ，它们三个之间可以相互倒可乐 (都是没有刻度的，且 S==N+M，101＞S＞0，N＞0，M＞0) 。聪明的ACMER你们说他们能平分吗？如果能请输出倒可乐的最少的次数，如果不能输

2021-08-01 13:08:42 95

原创 hdu 1260

dp买票Jesus, what a great movie! Thousands of people are rushing to the cinema. However, this is really a tuff time for Joe who sells the film tickets. He is wandering when could he go back home as early as possible.A good approach, reducing the total tim

2021-08-01 13:06:45 69

原创 HDU - 2955 HDU - 1203 01背包+变形

RobberiesThe aspiring Roy the Robber has seen a lot of American movies, and knows that the bad guys usually gets caught in the end, often because they become too greedy. He has decided to work in the lucrative business of bank robbery only for a short whi

2021-08-01 12:54:26 79

weixin_53035411的博客