Kuguotao的博客

Cao Cao made up a big army and was going to invade the whole South China. Yu Zhou was worried about it. He thought the only way to beat Cao Cao is to have a spy in Cao Cao's army. But all generals and...

时间限制:10000ms 单点时限:1000ms 内存限制:256MB 描述 You are given anN×Nmatrix. At the beginning every element is 0. Write a program supporting 2 operations: 1. Addxyvalue: Addvalueto the elementAxy...

Problem Description C国的死对头A国这段时间正在进行军事演习，所以C国间谍头子Derek和他手下Tidy又开始忙乎了。A国在海岸线沿直线布置了N个工兵营地,Derek和Tidy的任务就是要监视这些工兵营地的活动情况。由于采取了某种先进的监测手段，所以每个工兵营地的人数C国都掌握的一清二楚,每个工兵营地的人数都有可能发生变动，可能增加或减少若干人手,但这些都逃不过C国的监视。 ...

There is an apple tree outside of kaka's house. Every autumn, a lot of apples will grow in the tree. Kaka likes apple very much, so he has been carefully nurturing the big apple tree. The tree hasN...

D. Restore Permutation 题意：第一行给你一个数n，第二行输入n个数，第 i 个数表示其前面的所有比其小的数的和，让你还原这个原数列（该原数列数值1->n）。 思路：从后往前解决。利用树状数组求出tree[i]。利用二分查找a[i]，确定位置，存入s[i]，最后输出。 代码： #include <cstdio> #include <queue&...