C. Splitting the Uniqueness time limit per test:1 second memory limit per test:256 megabytes input:standard input output:standard output Polar bears like unique arrays — that is, arrays without repeated elements. You have got a unique array s with le…

题意 Split a unique array into two almost unique arrays. unique arrays指数组各个数均不相同,almost unique arrays指可以删掉数后再判断. 思路 略神的数学构造题... 官方题解: An equivalent definition for almost unique, is arrays with at least ⌊ 2n / 3⌋ different elements. The idea is to split…

题目链接 \(Description\) 给定一个长为n的序列A,求两个长为n的序列B,C,对任意的i满足B[i]+C[i]=A[i],且B,C序列分别至少有\(\lfloor\frac{2*n}{3}\rfloor\)个元素不同. A中元素各不相同,Ai,Bi,Ci均为非负整数. \(Solution\) 取\(k=\lfloor\frac{n}{3}\rfloor\),将B,C序列分成三份.可以先将A进行排序. B序列1~k取0~k-1,C序列k+1~2k取k~2k-1,C 2k+1~n取0…

题意 序列s有n个数,每个数都是不同的,把它每个数分成两个数,组成两个序列a和b,使ab序列各自去掉个数后各自的其它数字都不同. 如果存在一个划分,就输出YES,并且输出两个序列,否则输出NO. 分析 两个月前做的一题,那时候问学长才会做的,现在刚看到题又懵逼了.再做过了一遍. 序列s的每个数都是不同的,我们先给s按递增排序,然后构造:k=   前个数 第二个个数  剩下≤个数 s s[i] s[i+k] s[i+2*k] a s[i] 0   b 0 s[i+k] 0 1 2 ...  ..2…

A. Snow Footprints 如果只有L或者只有R,那么起点和终点都在边界上,否则在两者的边界. B. Sail 每次根据移动后的曼哈顿距离来判断是否移动. C. Parity Game 如果当前1的个数是偶数,则1的个数不会再增加:如果是奇数,则加1后不会再增加. 当前串可以组合成任意种组合,组合中的1不超过最大值. D. Fish Weight \(Diff = \sum{di\cdot wi}\) 假设\(w_1+=dw\),因为有\(0<w_1<=w_2<=\cdots&…

A. The Text Splitting 题目连接: http://www.codeforces.com/contest/612/problem/A Description You are given the string s of length n and the numbers p, q. Split the string s to pieces of length p and q. For example, the string "Hello" for p = 2, q = 3…

A. Lesha and array splitting time limit per test:2 seconds memory limit per test:256 megabytes input:standard input output:standard output One spring day on his way to university Lesha found an array A. Lesha likes to split arrays into several parts.…

A. Splitting in Teams time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output There were n groups of students which came to write a training contest. A group is either one person who can write the…

地址: 题目: C. Maximum splitting time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output You are given several queries. In the i-th query you are given a single positive integer ni. You are to represe…

http://codeforces.com/contest/754/problem/A 题意: 给出一串序列,现在要把这串序列分成多个序列,使得每一个序列的sum都不为0. 思路: 先统计一下不为0的数,只要有一个不为0的数,那么就能分割. 如果一个数不为0,则让它单独成为一组,如果它后面有0,则把它后面的连续的0也归到这一组中. 特别要注意一下的是,序列一开始就是0的情况. #include<iostream> #include<algorithm> #include<cs…