乐着过一辈子的专栏

/*Safe Or Unsafe Time Limit : 2000/1000ms (Java/Other) Memory Limit : 32768/32768K (Java/Other)Total Submission(s) : 9 Accepted Submission(s) : 5Problem DescriptionJavac++ 一天在看计算机的书籍的时候，看到了一个有

DescriptionYou have N integers, A1, A2, ... , AN. You need to deal with two kinds of operations. One type of operation is to add some given number to each number in a given interval. The other is

/*Colored Sticks Time Limit : 10000/5000ms (Java/Other) Memory Limit : 256000/128000K (Java/Other)Total Submission(s) : 0 Accepted Submission(s) : 0Problem DescriptionYou are given a bunch of

#include#include#include#includeint f[200010], n, idnum, sum[200010];struct tree{ int id; tree *next[52];}root;int finds(char *s){ tree *p = &root, *q; int i, j,

/*A Simple Problem with IntegersTime Limit: 5000/1500 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3885 Accepted Submission(s): 1197Problem DescriptionLet

/*NecklaceTime Limit: 15000/5000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3216 Accepted Submission(s): 1108Problem DescriptionMery has a beautiful neck

/*GroupTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1431 Accepted Submission(s): 754Problem DescriptionThere are n men ,every man has

/*AttackTime Limit: 5000/3000 MS (Java/Others) Memory Limit: 65768/65768 K (Java/Others)Total Submission(s): 1947 Accepted Submission(s): 566Problem DescriptionToday is the 10th Annual of

/*What Are You Talking AboutTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 102400/204800 K (Java/Others)Total Submission(s): 15270 Accepted Submission(s): 4903Problem DescriptionIgn

#include#include#include#include#define MAX 100000000struct bus{ int id; bus * next[54];}root;int busid, dis[155][155], d[155], n;int getid(char *s){ int i, j, k, l; bus *p

/*敌兵布阵Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 46397 Accepted Submission(s): 19679Problem DescriptionC国的死对头A国这段时间正在进行军事演习，所以C国间谍

/*统计难题 Time Limit : 4000/2000ms (Java/Other) Memory Limit : 131070/65535K (Java/Other)Total Submission(s) : 3 Accepted Submission(s) : 1Font: Times New Roman | Verdana | Georgia Font Size: ← →

问题描述有n个格子，从左到右放成一排，编号为1-n。共有m次操作，有3种操作类型：1.修改一个格子的权值，2.求连续一段格子权值和，3.求连续一段格子的最大值。对于每个2、3操作输出你所求出的结果。输入格式第一行2个整数n，m。接下来一行n个整数表示n个格子的初始权值。接下来m行，每行3个整数p,x,y，p表示操作类型，p=1时表示修改格子x的权