SCUT_Pein

#include#include#include#include#include#define N 1024*1024*2#define inf 1<<29#define MOD 100000007#define LL long long#define Key_value ch[ch[root][1]][0]#define _match(a,b) ((a)=

DescriptionInput输入文件的第1行包含两个数N和M，N表示初始时数列中数的个数，M表示要进行的操作数目。第2行包含N个数字，描述初始时的数列。以下M行，每行一条命令，格式参见问题描述中的表格。Output对于输入数据中的GET-SUM和MAX-SUM操作，向输出文件依次打印结果，每个答案（数字）占一行。Sample Input9 8

DescriptionWind loves pretty dogs very much, and she has n pet dogs. So Jiajia has to feed the dogs every day for Wind. Jiajia loves Wind, but not the dogs, so Jiajia use a special way to feed the d

#include#include#includeusing namespace std;#define Keytree (ch[ ch[root][1] ][0])const int maxn = 100010;struct node { int num,id;}in[maxn];int id[maxn];int cmp(node a,node b){

I am a magician. I have a string of emeralds and pearls. I may insert new jewels in the string, or remove old ones. I may even reverse a consecutive part of the string. At anytime, if you point to two

Now you have N lights in a line. Don't worry - the lights don't have color. The only status they have is on and off. And, each light has a value, too.There is a boring student in ZJU. He decides t

将每一个依次插入，与前驱和后继进行比较，选取差值小的。如果遇到相同的数已经在树中，则不插入。#include #include #include using namespace std;#define maxn 100010#define inf 0x3f3f3f3fint pre[maxn],key[maxn],ch[maxn][2],root,tot1;int

#include#include#include#include#include#define N 200005#define inf 1<<29#define MOD 100000007#define LL long long#define Key_value ch[ch[root][1]][0]#define _match(a,b) ((a)==(b))

#include#include#include#include#include#define N 300015#define inf 1<<29#define MOD 100000007#define LL long long#define Key_value ch[ch[root][1]][0]#define _match(a,b) ((a)==(b))

#include#include#include#include#define N 100015#define inf 1<<29#define LL long long#define Key_value ch[ch[root][1]][0]using namespace std;int n,q,p[N],cnt,s[2*N],e[2*N],ope[N];i

Write a program to transform the permutation 1, 2, 3,..., n according to m instructions. Each instruction(a, b) means to take out the subsequence from the a-th to the b-th element, reverse it, then

#include #include #include using namespace std;#define maxn 100010#define inf 0x3f3f3f3f#define LL long long int#define Key_value ch[ch[root][1]][0]int pre[maxn],key[maxn],ch[maxn][2],

#include#include#include#include#include#define N 500005#define inf 1<<29#define MOD 100000007#define LL long long#define Key_value ch[ch[root][1]][0]#define _match(a,b) ((a)==(b))

DescriptionOIER公司是一家大型专业化软件公司，有着数以万计的员工。作为一名出纳员，我的任务之一便是统计每位员工的工资。这本来是一份不错的工作，但是令人郁闷的是，我们的老板反复无常，经常调整员工的工资。如果他心情好，就可能把每位员工的工资加上一个相同的量。反之，如果心情不好，就可能把他们的工资扣除一个相同的量。我真不知道除了调工资他还做什么其它事情。工资的频繁调整很让员工反感，