Pagini recente » Cod sursa (job #3263109) | Cod sursa (job #770798) | Cod sursa (job #2701151) | Cod sursa (job #2555732) | Cod sursa (job #2801878)
#include <iostream>
#include <stdio.h>
#include <ctype.h>
#include <fstream>
class InParser {
private:
FILE *fin;
char *buff;
int sp;
char read_ch() {
++sp;
if (sp == 4096) {
sp = 0;
fread(buff, 1, 4096, fin);
}
return buff[sp];
}
public:
InParser(const char* nume) {
fin = fopen(nume, "r");
buff = new char[4096]();
sp = 4095;
}
InParser& operator >> (int &n) {
char c;
while (!isdigit(c = read_ch()) && c != '-');
int sgn = 1;
if (c == '-') {
n = 0;
sgn = -1;
} else {
n = c - '0';
}
while (isdigit(c = read_ch())) {
n = 10 * n + c - '0';
}
n *= sgn;
return *this;
}
InParser& operator >> (long long &n) {
char c;
n = 0;
while (!isdigit(c = read_ch()) && c != '-');
long long sgn = 1;
if (c == '-') {
n = 0;
sgn = -1;
} else {
n = c - '0';
}
while (isdigit(c = read_ch())) {
n = 10 * n + c - '0';
}
n *= sgn;
return *this;
}
};
#include <cstdio>
#include <cstring>
using namespace std;
class OutParser {
private:
FILE *fout;
char *buff;
int sp;
void write_ch(char ch) {
if (sp == 50000) {
fwrite(buff, 1, 50000, fout);
sp = 0;
buff[sp++] = ch;
} else {
buff[sp++] = ch;
}
}
public:
OutParser(const char* name) {
fout = fopen(name, "w");
buff = new char[50000]();
sp = 0;
}
~OutParser() {
fwrite(buff, 1, sp, fout);
fclose(fout);
}
OutParser& operator << (int vu32) {
if (vu32 <= 9) {
write_ch(vu32 + '0');
} else {
(*this) << (vu32 / 10);
write_ch(vu32 % 10 + '0');
}
return *this;
}
OutParser& operator << (long long vu64) {
if (vu64 <= 9) {
write_ch(vu64 + '0');
} else {
(*this) << (vu64 / 10);
write_ch(vu64 % 10 + '0');
}
return *this;
}
OutParser& operator << (char ch) {
write_ch(ch);
return *this;
}
OutParser& operator << (const char *ch) {
while (*ch) {
write_ch(*ch);
++ch;
}
return *this;
}
};
int A[15001], n;
void update(int poz, int val)
{
for(int i = poz; i <= n; i += (i&-i))
A[i] -= val;
}
int query(int poz)
{
int s = 0;
for(int i = poz; i > 0; i -= (i&-i))
s += A[i];
return s;
}
int main()
{
InParser fin("datorii.in");
OutParser fout("datorii.out");
int q, x, op, T, V, st, dr, i;
fin >> n >> q;
for(i = 1; i <= n; i++)
{
fin >> x;
update(i, x);
}
for(i = 1; i <= q; i++)
{
fin >> op;
if(op == 1)
{
fin >> st >> dr;
fout << query(dr) - query(st-1) << '\n';
}
else
{
fin >> T >> V;
update(T, V);
}
}
return 0;
}