As time goes by

。。。

 挤上拥挤的公交车,三个女人分两伙因为身体上的摩擦骂得我都不好意思听了,车上还是有好人告诉我路上哪有大超市。

意大利面条,番茄酱司,啤酒,土豆,葱头,胡萝卜,黄瓜,猪肉馅,一人买了这些东西站在超市菜摊前和家庭主妇们挤来挤去,感觉变态了点。

出了超市,灰蒙蒙的天下起雨,这两年的今天总是这样,我的心情也是这样。领着两个大塑料袋东西,在车里晃来晃去,鸡翅膀都能透过塑料袋被车上大妈看见的样子真是狼狈。

到家了想起同进电梯的母子的对话现在心理有点难受。我进电梯时,那小男孩坐在看电梯的椅子上,一直按着开门键,我对小驾驶员说:“8层”。“等等还有人”他是在等妈妈。“妈妈,你知道下星期的今天是什么日子吗?”“我记着呢,你生日。”儿子总走在妈妈的前边。

我按门铃,敲门,打电话家里都没人。。。

楼道里黑黑的,我的两个大塑料袋子扔在了门口地上

Every year the cows hold an event featuring a peculiar version of hopscotch that involves carefully jumping from rock to rock in a river. The excitement takes place on a long, straight river with a rock at the start and another rock at the end, L units away from the start (1 ≤ L ≤ 1,000,000,000). Along the river between the starting and ending rocks, N (0 ≤ N ≤ 50,000) more rocks appear, each at an integral distance Di from the start (0 < Di < L). To play the game, each cow in turn starts at the starting rock and tries to reach the finish at the ending rock, jumping only from rock to rock. Of course, less agile cows never make it to the final rock, ending up instead in the river. Farmer John is proud of his cows and watches this event each year. But as time goes by, he tires of watching the timid cows of the other farmers limp across the short distances between rocks placed too closely together. He plans to remove several rocks in order to increase the shortest distance a cow will have to jump to reach the end. He knows he cannot remove the starting and ending rocks, but he calculates that he has enough resources to remove up to M rocks (0 ≤ M ≤ N). FJ wants to know exactly how much he can increase the shortest distance *before* he starts removing the rocks. Help Farmer John determine the greatest possible shortest distance a cow has to jump after removing the optimal set of M rocks. Input Line 1: Three space-separated integers: L, N, and M Lines 2..N+1: Each line contains a single integer indicating how far some rock is away from the starting rock. No two rocks share the same position. Output Line 1: A single integer that is the maximum of the shortest distance a cow has to jump after removing M rocks Sample Inputcopy Outputcopy 25 5 2 2 14 11 21 17 4 Hint Before removing any rocks, the shortest jump was a jump of 2 from 0 (the start) to 2. After removing the rocks at 2 and 14, the shortest required jump is a jump of 4 (from 17 to 21 or from 21 to 25).
07-24
评论 1
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值