03 2019 档案

摘要:Rainforest Inc. is opening a large new automated warehouse in the far Northern reaches of theUK—some place they call “Walthamstow”. The robotic worker 阅读全文
posted @ 2019-03-25 20:37 断腿三郎 阅读(361) 评论(0) 推荐(0)
摘要:Several cards with numbers printed on them are lined up on the table. We’d like to change their order so that first some are in non-decreasing order o 阅读全文
posted @ 2019-03-25 18:11 断腿三郎 阅读(546) 评论(0) 推荐(0)
摘要:都说天上不会掉馅饼,但有一天gameboy正走在回家的小径上,忽然天上掉下大把大把的馅饼。说来gameboy的人品实在是太好了,这馅饼别处都不掉,就掉落在他身旁的10米范围内。馅饼如果掉在了地上当然就不能吃了,所以gameboy马上卸下身上的背包去接。但由于小径两侧都不能站人,所以他只能在小径上接。 阅读全文
posted @ 2019-03-23 23:36 断腿三郎 阅读(367) 评论(0) 推荐(0)
摘要:Ignatius has just come back school from the 30th ACM/ICPC. Now he has a lot of homework to do. Every teacher gives him a deadline of handing in the ho 阅读全文
posted @ 2019-03-23 17:34 断腿三郎 阅读(164) 评论(0) 推荐(0)
摘要:Let us call underpalindromity of array b of length k the minimal number of times one need to increment some elements bj by 1 so that the array b would 阅读全文
posted @ 2019-03-18 18:00 断腿三郎 阅读(283) 评论(0) 推荐(0)
摘要:There is a tree of n vertices. For each vertex a list of all its successors is known (not only direct ones). It is required to restore the tree or to 阅读全文
posted @ 2019-03-16 16:54 断腿三郎 阅读(253) 评论(0) 推荐(0)
摘要:Bob and Alice are playing a new game. There are n boxes which have been numbered from 1 to n. Each box is either empty or contains several cards. Bob 阅读全文
posted @ 2019-03-13 12:10 断腿三郎 阅读(315) 评论(0) 推荐(0)
摘要:E. Explosion Exploit time limit per test 2.0 s memory limit per test 256 MB input standard input output standard output E. Explosion Exploit time limi 阅读全文
posted @ 2019-03-12 19:10 断腿三郎 阅读(353) 评论(0) 推荐(0)
摘要:Calendar Game Time Limit: 5000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 6052 Accepted Submission(s): 3618 P 阅读全文
posted @ 2019-03-08 14:17 断腿三郎 阅读(249) 评论(1) 推荐(0)
摘要:Every year, Farmer John's N (1 <= N <= 20,000) cows attend "MooFest",a social gathering of cows from around the world. MooFest involves a variety of e 阅读全文
posted @ 2019-03-08 12:15 断腿三郎 阅读(238) 评论(0) 推荐(0)
摘要:题意: 有n辆车,在一条直线上运动,给定位置和速度。如果后车追上前车,则后车不会超车,而已变成前车的速度前进,问最后一次上述车速变化发生在何时。 思路: 假设有一下车辆,数字代表移动速度,具体位置未知,但是相对未知就是数字的摆放顺序,车辆移动方向为右,车辆用速度代称; 8 4 3 5 2 6 7 由 阅读全文
posted @ 2019-03-05 15:13 断腿三郎 阅读(373) 评论(0) 推荐(0)
摘要:https://vjudge.net/contest/282991#problem/E 别人的博客:https://wizmann.tk/minimal-round-string.html 我自己想了一个证明方式,已经满足自己了,只不过自己证出来的东西,放在博客上怕误人子弟,要是你非要看的话。。。 阅读全文
posted @ 2019-03-04 18:23 断腿三郎 阅读(152) 评论(0) 推荐(0)