Pagini recente » Cod sursa (job #2846180) | Cod sursa (job #2724783) | Cod sursa (job #1613220) | Cod sursa (job #647704) | Cod sursa (job #1867077)
#include <fstream>
#define NMAX 15001
#define buff_size 131072
char outBuff[buff_size];
int outPtr;
char buff[buff_size];
int pos=0;
using namespace std;
FILE*f=freopen("datorii.in","r",stdin);
FILE*g=freopen("datorii.out","w",stdout);
int n,m,t[2 * NMAX],q,a,b,sum;
inline void read(int &nr)
{
while(!isdigit(buff[pos])) if(++pos == buff_size) fread(buff, 1,buff_size, stdin), pos = 0;
nr = 0;
while(isdigit(buff[pos]))
{
nr = (nr<<1)+(nr<<3)+ buff[pos] - 48;
if(++pos == buff_size) fread(buff, 1, buff_size, stdin), pos = 0;
}
}
int main()
{
read(n);read(m);
for (int i = 0; i < n; ++i) read(t[n+i]);
for (int i = n - 1; i > 0; --i) t[i] = t[i<<1] + t[i<<1|1];
while(m--)
{
read(q);read(a);read(b);
if(q==1)
{sum=0;a--;
for (a+= n, b += n; a < b; a >>= 1, b >>= 1)
{ if (a&1) sum += t[a++];
if (b&1) sum += t[--b];
}
printf("%d\n",sum);
}
else for (t[a += n] -= b,a--; a> 1; a >>= 1)t[a>>1] -= b;
}
}