SwapSort time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output In this problem your goal is to sort an array consisting of n integers in at most n swaps. For the given array find the sequence of swaps that makes the array sorted in the non-descending order. S...
A. SwapSort time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output In this problem your goal is to sort an array consisting of n integers in at ...
A. SwapSort time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output In this problem your goal is to sort an array consisting of n integers in at most n swaps. For the given array find the sequence of swaps that makes the array sorted in the non-descending order. Sw...
A. SwapSort time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output In this problem your goal is to sort an array consisting of n integers in at most n swaps. For the given array find the sequen...
B. Candy Boxes time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output There is an old tradition of keeping 4 boxes of candies in the house in Cyberland. The numbers of candies are special if th...
还是只会4道。。sad。。。 A：SwapSort 用一个数组存储排好序之后。然后从头开始依次将需要交换的与本来应该在这个位置的交换，最多交换n-1次。 代码如下； #include #include #include #include #include #include #include #include #include #include #include using namespace std;int a[4000], b[4000], c[4000], d[4000];int main(){ int i, j, n, pos, cnt; while(scanf("%d",&n)!=EOF) { cnt=0; ...
C. Given Length and Sum of Digits... time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output You have a positive integer m and a non-negative int...
看到这题很开心啊，有印象跟以前做过的很像，貌似最近就做过一个，以时间戳为区间来建立树状数组，然后一开始我以为题意是，给x点加val，它以下的所有节点都加-val；所以一开始就以 加 和 减 建立了两个树状数组，最后 减去就是答案，写完发现跟案例对不上啊，读了题目也没发现读错了，对于那句话 我理解错了，后来看了 这个： http://blog.csdn.net/keshuai19940722/article/details/18967661 仔细看看处理部分，我还以为分奇...
哎，自己好水啊，明明第二题可以出的，哎，因为数组开小了，wa了，真蛋疼啊。。。。 第一题： 思路：开三个数组保存一起，然后最后取最小值，那个这就是匹配的对数。 题目： A. Team Olympiad time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output The School №0 of...
Giga Tower time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output Giga Tower is the tallest and deepest building in Cyberland. There are 17?777?777?777 floors, numbered from ?-?8?888?888?888 to 8?888?888?888. In particular, there is floor 0 between floor ?-?1 ...
Team Olympiad time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output The School №0 of the capital of Berland has n children studying in it. All the children in this school are gifted: some of them are good at programming, some are good at maths, others are go...
C. Hacking Cypher time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output Polycarpus participates in a competition for hacking into a new secure messenger. Hes almost won. Having carefully studied the interaction protocol, Polycarpus came to the conclusion that ...
A - Team Olympiad 贪心水题。。都从第一个开始取即可。 代码如下： #include #include #include #include #include #include #include #include #include #include #include using namespace std;#define LL __int64int a[6000], b[6000];int main(){ int n, x, y, z, ans, i, j; while(scanf("%d",&n)!=EOF) { x=y=z=0; for(i=0;i<n;i++) { scanf("%d",&a[i]); } m...
题目链接： huangjing 题意：告诉一个无向无环图，然后求在联通的路上的lis。 思路：枚举起点求lis 复杂度是n^2logn,貌似这复杂度对时间有点玄，估计是数据有点弱。。。 首先枚举起点，然后求lis，主要是用dfs求的，要用到回溯的思想，我觉得是只要更新了，就要保存那个操作，然后一旦这一次的搜索完成，那么就要立即回复g数组的值，因为有很多不同的路线，所以一条路走完后，就要回复以前的状态哦，免得影响另外一条路。。...
B. Sort the Array time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output Being a programmer, you like arrays a lot. For your birthday, your friends have given you an array a consisting of n distinct integers. Unfortunately, the size of a is too small. You want a ...