摘要：贪心？瞎搞 先排个序，然后扫一遍，边扫边维护一个数组v v的长度为3 设vs数组的最后一个是x 如果abs(a[i]-x)大于10 那么贪心的策略我就 添加个v+10相应的ans++. 如果v数组的长度到达3了,就清空v数组。 然后注意一些细节就好了... 我代码写的好挫 阅读全文

摘要：B. T-primes time limit per test 2 seconds time limit per test memory limit per test 256 megabytes memory limit per test input standard input input out 阅读全文

摘要：XMAX - XOR Maximization Given a set of integers S = { a1, a2, a3, ... a|S| }, we define a function X on S as follows:X( S ) = a1 ^ a2 ^ a3 ^ ... ^ a|S 阅读全文

摘要：Consider an arbitrary sequence of integers. One can place + or - operators between integers in the sequence, thus deriving different arithmetical expr 阅读全文

摘要：1009. K-based Numbers Time limit: 0.5 secondMemory limit: 64 MB Let’s consider K-based numbers, containing exactly N digits. We define a number to be 阅读全文

摘要：There are given two strings, A and B. An expansion of some string X is a string created by adding or inserting any number (zero, one or more) of blank 阅读全文

摘要：N cities named with numbers 1 ... N are connected with one-way roads. Each road has two parameters associated with it: the road length and the toll th 阅读全文