题目链接:http://codeforces.com/contest/1157/problem/C2 题目: The only difference between problems C1 and C2 is that all values in input of problem C1 are di Read More
posted @ 2019-07-26 20:16 小小笼包包 Views(124) Comments(0) Diggs(0)
题目链接:http://codeforces.com/problemset/problem/1157/C1 思路: 题意就是从序列的左端或者右端拿出数字,组成一个递增的序列。模拟这个过程就能做出来。 AC代码: Read More
posted @ 2019-07-26 19:13 小小笼包包 Views(170) Comments(0) Diggs(0)
题目链接:http://codeforces.com/problemset/problem/1157/B 思路: 大致题意就是一个长串数字中连续的一段的i可以用f(i)替换,得到的最大值是多少。 这个就是从前往后遍历,f(i)大于i就开始替换,遇到小于i的就停止。要注意开始替换的位置 AC代码 Read More
posted @ 2019-07-26 19:10 小小笼包包 Views(115) Comments(0) Diggs(0)
题目链接:http://codeforces.com/problemset/problem/1157/A 题目 Let's denote a function f(x) in such a way: we add 1 to x , then, while there is at least one Read More
posted @ 2019-07-26 19:06 小小笼包包 Views(240) Comments(0) Diggs(0)
题目链接:http://codeforces.com/problemset/problem/1183/F 题目 One important contest will take place on the most famous programming platform (Topforces) very Read More
posted @ 2019-07-26 11:48 小小笼包包 Views(129) Comments(0) Diggs(0)