Cod sursa(job #2903453)

Utilizator IonescuRalucaIonescu Andreea Raluca IonescuRaluca Data 17 mai 2022 16:28:55
Problema Datorii Scor 40
Compilator cpp-64 Status done
Runda Arhiva de probleme Marime 1.33 kb
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("datorii.in");
ofstream g("datorii.out");
int a[60006];
void update(int nod, int st, int dr, int poz, int val)
{
    if(st==dr)
    {
        a[nod]=val;
        return;
    }
    int mij=(st+dr)/2;
    if(poz<=mij)  update(2*nod, st,mij, poz,val);//subarb stang
    else  update(2*nod+1,mij+1,dr,poz,val);//subarb drept

    a[nod]=a[2*nod]+a[2*nod+1]; //suma fiilor
}
void achitare(int nod, int st, int dr, int poz, int val)
{
    if(st==dr)
    {
        a[nod]=a[nod]-val; //se scade din acel nod valoarea achitata
        return;
    }
    int mij=(st+dr)/2;

    if(poz<=mij)   achitare(2*nod, st,mij, poz,val);

    else  achitare(2*nod+1,mij+1,dr,poz,val);

    a[nod]=a[2*nod]+a[2*nod+1];
}
int query(int nod, int st, int dr, int x,int y)
{
    if(x<=st && dr<=y) return a[nod];

    int s1=0, s2=0;

    int mij =(st+dr)/2;

    if(x<=mij)  s1=query(2*nod,st,mij,x,y);

    if(y>mij)  s2=query(2*nod+1, mij+1,dr, x ,y);

    return s1+s2;
}

int main()
{
    int n,m,cod,x,y;
    f>>n>>m;
    for(int i=1;i<=n;i++)
    {
        f>>x;
        update(1,1,n,i,x);
    }
    for(int i=1;i<=m;i++)
    {
        f>>cod>>x>>y;
        if(cod==0)  //achitare
             achitare(1,1,n,x,y);

        if(cod==1)  //interogare
            g<<query(1,1,n,x,y)<<'\n';

    }
    return 0;
}