Pagini recente » Cod sursa (job #2986654) | Cod sursa (job #1669809) | Cod sursa (job #2050939) | Cod sursa (job #2980367) | Cod sursa (job #2262296)
#include <fstream>
using namespace std;
ifstream fin("datorii.in");
ofstream fout("datorii.out");
int N, M;
int aib[15005];
inline int LastBit(int x)
{
return x & (-x);
}
void Update(int pos, int value)
{
for(int i = pos; i <= N; i += LastBit(i))
aib[i] += value;
}
int Query(int pos)
{
int answer = 0;
for(int i = pos; i > 0; i -= LastBit(i))
answer += aib[i];
return answer;
}
int main()
{
int t, x, y;
fin >> N >> M;
for(int i = 1; i <= N; i++)
{
fin >> x;
Update(i, x);
}
for(int i = 1; i <= M; i++)
{
fin >> t >> x >> y;
if(t == 0)
Update(x, -y);
else
fout << Query(y) - Query(x - 1) << '\n';
}
return 0;
}