![](https://img-blog.csdnimg.cn/20201014180756916.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
训练赛
ischanx
GDUT本科毕业,前端
展开
-
[Codeforces 115B] Lawnmower
题目传送门:点击传送Time limit per test:2 secondsMemory limit per test:256 megabytesDescriptionYou have a garden consisting entirely of grass and weeds. Your garden is described by ann × mgrid, with...原创 2019-03-02 12:01:53 · 280 阅读 · 1 评论 -
[Codeforces 1015E1] Stars Drawing (Easy Edition)
题目传送门:点击传送Time limit per test:3 secondsMemory limit per test:256 megabytesDescriptionAstaris a figure of the following type: an asterisk character '*' in the center of the figure and four ...原创 2019-03-01 22:16:52 · 400 阅读 · 0 评论 -
[Codeforces80B] Depression
题目传送门:点击传送Time limit per test:1 secondMemory limit per test:256 megabytesDescriptionDo you remember a kind cartoon "Beauty and the Beast"? No, no, there was no firing from machine guns or ra...原创 2019-02-20 15:26:49 · 178 阅读 · 0 评论 -
[Codeforces 948A] Protect Sheep (DFS)
题目传送门:点击传送Time limit per test:1 secondMemory limit per test:256 megabytesDescriptionBob is a farmer. He has a large pasture with many sheep. Recently, he has lost some of them due to wolf at...原创 2019-02-20 14:56:25 · 264 阅读 · 0 评论 -
[Codeforces 500C] New Year Book Reading (贪心?)
解析题意:给n本书你,每本书对应一个重量。要看m天的书,当天要看的书需要放在表面。如果当天要看的书被压着,就要抽起上面的书(lift),最后算总共lift的最小值。(具体过程可看Hint图片)思路:想要lift最小,自然就是把要看的书放在前面。按照看书的顺序(第一次出现)排好顺序,然后模拟过程,得到的即为答案。原创 2019-03-14 11:08:52 · 115 阅读 · 0 评论