dxyinme-Zz

对于STL的优先队列 priority_queue来说 如果你定义：priority_queue< int >q;那么它将是一个大根堆。如果定义priority_queue< int , vector<int>, less<int> >q;那么它也是一个大根堆。如果定义priority_queue<int, vector<int> , greater&

Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/65536 K (Java/Others)分数：2500，构造还是比较难的Problem DescriptionThe Old Frog King lives on the root of an infinite tree. According to the law, eac...

time limit per test : 2 secondsmemory limit per test : 256 megabytesAn array of integers p1,p2,…,pnp_1,p_2,…,p_np1​,p2​,…,pn​ is called a permutation if it contains each number from 111 to nnn exact...

time limit per test : 1.5 secondsmemory limit per test : 256 megabytes分数：2500（补的有趣的老题）In 2N − 12N - 12N − 1 boxes there are apples and oranges. Your task is to choose NNN boxes so, that they will c...

Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 262144/262144 K (Java/Others)Problem DescriptionTom has a string containing only lowercase letters. He wants to choose a subsequence of the strin...

time limit per test : 2 secondsmemory limit per test : 256 megabytesThe only difference between easy and hard versions is that you should complete all the projects in easy version but this is not ne...

链接：https://ac.nowcoder.com/acm/contest/881/C来源：牛客网Bobo has a point A in the nnn dimension real space RnR_nRn​, whose coodinate is (a1/m,a2/m,…,an/m)(a_1/m,a_2/m,…,a_n/m)(a1​/m,a2​/m,…,an​/m) where a...

A. XOR Circle题意：给定n(n&lt;=105)n(n&lt;=10^5)n(n<=105)个数字a[1]a[1]a[1]~a[n]a[n]a[n]，询问是否能够将其重排成一个首位相接的环形数组，使得每个a[i](1&lt;=i&lt;=n)a[i](1&lt;=i&lt;=n)a[i](1<=i<=n)等于与其相邻...

time limit per test : 1 secondmemory limit per test : 256 megabytesYou are given positive integer number nnn. You should create such strictly increasing sequence of kkk positive numbers a1, a2, ...,...

time limit per test : 1 secondmemory limit per test : 256 megabytesLet s be some string consisting of symbols “0” or “1”. Let’s call a string t a substring of string s, if there exists such number 1...

time limit per test : 2 secondsmemory limit per test : 256 megabytesAlice has a string consisting of characters ′A′&#x27;A&#x27;′A′, ′B′&#x27;B&#x27;′B′ and ′C′&#x27;C&#x27;′...

太弱鸡了，所以只有4题。（C题最难，没有之一）A. 给你一个数字x，问能不能补充几个前导零使得他变成回文数（可以补充0个前导零）模拟题 #include<iostream>#include<cstdio>#include<cstdlib>#include<cstring>#include<cmath>#include<algorithm>#include<queue>#include<

time limit per test : 1.0 smemory limit per test : 256 MBYou are given a string consisting of letters ′a′,′b′'a', 'b'′a′,′b′ and ′c′'c'′c′, and there are 444 kinds of operations you can do on it:Re...