0xFFFFINF

题意： 将一个字符串只能通过相邻字符交换从而反转，问需要多少次数 思路： 我们从末尾开始，往前把字符交换，如果字符串里没有重复字母的话，这样就是最优秀的 ， 相邻交换，求逆序对即可 ，但对于有重复字母，我们需要肯定将较前的字母先往前把字符交换，这样次数一定会更少，所有从后往前遍历，记录下标，这样保证前面的字符会首先取得，用栈也可以，然后选择好位置用树状数组求逆序对即可 #include <bits/stdc++.h> using namespace std; const int N = 2.

This is the easy version of the problem. The difference between the versions is that the easy version has no swap operations. You can make hacks only if all versions of the problem are solved. Pikachu is a cute and friendly pokémon living in the wild pikac

Danik urgently needs rock and lever! Obviously, the easiest way to get these things is to ask Hermit Lizard for them. Hermit Lizard agreed to give Danik the lever. But to get a stone, Danik needs to solve the following task. You are given a positive intege

Wheatley decided to try to make a test chamber. He made a nice test chamber, but there was only one detail absent — cubes. For completing the chamber Wheatley needs n cubes. i-th cube has a volume ai. Wheatley has to place cubes in such a way that they wou

outputstandard output This is the hard version of the problem. The difference between the versions is that in the easy version all prices ai are different. You can make hacks if and only if you solved both versions of the problem. Today is Sage’s birthday,

outputstandard output A new agent called Killjoy invented a virus COVID-2069 that infects accounts on Codeforces. Each account has a rating, described by an integer (it can possibly be negative or very large). Killjoy’s account is already infected and has

You are given a positive integer n. In one move, you can increase n by one (i.e. make n:=n+1). Your task is to find the minimum number of moves you need to perform in order to make the sum of digits of n be less than or equal to s. You have to answer t ind

We have a secret array. You don’t know this array and you have to restore it. However, you know some facts about this array: The array consists of n distinct positive (greater than 0) integers. The array contains two elements x and y (these elements are kn

题意： 给你一个01串 要求把他分成不同的子序列 并且子序列中不能有两个相同的数相邻 输出分成最少子序列的个数 并且 输出每个0或者1分别在哪个子序列 思路： 一开始看到这个题，就想到用栈或者队列来模拟这个过程，vector来存答案，但是栈无法得到最初未配对0或者1出现的位置，所以采用队列，我们开两个队列，一个用来存0的位置，一个用来存1的位置。 1.当遇到0时，首先肯定先找有没1和他配对，如果队列1为空的话，说明这个0得属于新的一个序列，就往vector里存答案，如果有的话，往答案里存入队列1里队头序列的

A. 题意：给出四个数 a b c d 要求从 a到b b到c c到d 选三个数构造三角形 思路：选b c c 就行 了 一定满足题意 B. 思路：贪心 一直使用第一种方法 然后在判断第二种方法能否将其杀死 记得特判单纯第二种方法就能杀死的情况 样例有给 #include <bits/stdc++.h> using namespace std; #define LL long lo...

B. Different Rules time limit per test1 second memory limit per test256 megabytes inputstandard input outputstandard output Nikolay has only recently started in competitive programming, but already qu...

D. Recommendations time limit per test2 seconds memory limit per test512 megabytes inputstandard input outputstandard output VK news recommendation system daily selects interesting publications of one...

D. Three Integers time limit per test2 seconds memory limit per test256 megabytes inputstandard input outputstandard output You are given three integers a≤b≤c. In one move, you can add +1 or −1 to any...

C. Perform the Combo time limit per test2 seconds memory limit per test256 megabytes inputstandard input outputstandard output You want to perform the combo on your opponent in one popular fighting ga...

C. Kuroni and Impossible Calculation time limit per test1 second memory limit per test256 megabytes inputstandard input outputstandard output To become the king of Codeforces, Kuroni has to solve the ...

A.https://ac.nowcoder.com/acm/contest/4853/A 思路：考虑位运算&的特性 只有两者都为1才会对答案有贡献 且 对答案贡献的值为 1 << k 其中k是当前1所在二进制下的位数 所以考虑预处理每一个位的1出现的次数 其中对每一位都会遍历n*n次 所以每一位对答案的贡献就是 a[i]a[i](1 << i) a[i]为当...

A. A. Contest for Robots time limit per test1 second memory limit per test256 megabytes inputstandard input outputstandard output Polycarp is preparing the first programming contest for robots. There ...