Pagini recente » Cod sursa (job #2492526) | Cod sursa (job #1918717) | Cod sursa (job #2561927) | Cod sursa (job #736314) | Cod sursa (job #1695434)
#include <fstream>
using namespace std;
ifstream fin("datorii.in");
ofstream fout("datorii.out");
int n, m, V[15005];
void Update(int a, int b)
{
int i;
for (i=a; i<=n; i+=(i^(i-1))&i)
{
V[i] -= b;
}
}
int Query(int a)
{
int tot=0, i;
for (i=a; i>=1; i-=(i^(i-1))&i)
{
tot+=V[i];
}
return tot;
}
int main()
{
int i, c, a, b, x;
fin>>n>>m;
for (i=1; i<=n; i++)
{
fin>>x;
Update(i, -1*x);
}
for (i=1; i<=m; i++)
{
fin>>c>>a>>b;
if (c==0)
{
Update(a, b);
}
if (c==1)
{
fout<<Query(b)-Query(a-1)<<'\n';
}
}
return 0;
}