数据结构
Dejavu1z
做题,总结,不断的学习
展开
-
codeforces 1374E1(贪心+优先队列)
题意描述Easy and hard versions are actually different problems, so read statements of both problems completely and carefully.Summer vacation has started so Alice and Bob want to play and joy, but… Their mom doesn’t think so. She says that they have to read s原创 2020-09-22 20:04:03 · 161 阅读 · 0 评论 -
codeforces 1343D(差分数组)
题意描述You are given an array a consisting of n integers (it is guaranteed that n is even, i.e. divisible by 2). All ai does not exceed some integer k.Your task is to replace the minimum number of elements (replacement is the following operation: choose som原创 2020-09-14 15:58:25 · 196 阅读 · 0 评论 -
codeforces 1353D(优先队列)
题意描述You are given an array a of length n consisting of zeros. You perform n actions with this array: during the i-th action, the following sequence of operations appears:Choose the maximum by length subarray (continuous subsegment) consisting only of zer原创 2020-09-13 11:40:16 · 242 阅读 · 0 评论 -
codeforces 1256D(优先队列+贪心)
题意描述You are given a binary string of length n (i. e. a string consisting of n characters ‘0’ and ‘1’).In one move you can swap two adjacent characters of the string. What is the lexicographically minimum possible string you can obtain from the given one原创 2020-09-08 20:46:48 · 189 阅读 · 0 评论