Cod sursa(job #1150714)

Utilizator jul123Iulia Duta jul123 Data 23 martie 2014 14:26:54
Problema Datorii Scor 100
Compilator cpp Status done
Runda Arhiva de probleme Marime 1.49 kb
#include<iostream>
#include<cstdio>

using namespace std;

int suma[100001], s=0, v[100000], x, pos, si, sf;
void Inserare(int nod, int left, int right)
{
        if(left==right)
            suma[nod]=v[x];
        else
        {
            int mij=(left+right)/2;
            if(pos<=mij)
                Inserare(2*nod, left, mij);
            else
                Inserare(2*nod+1, mij+1, right);
            suma[nod]=suma[2*nod]+suma[2*nod+1];
        }
}
void Interogare(int nod, int left, int right)
{
    if(si<=left && right<=sf)
            {s+=suma[nod];}
    else
    {
        int mij=(left+right)/2;
        if(si<=mij)
            Interogare(2*nod, left, mij);
        if(mij+1<=sf)
            Interogare(2*nod+1, mij+1, right);
    }
}
void Achitare(int zi, int val) {
    v[zi]-=val;
}
int main()
{
    FILE *fin, *fout;
    fin=fopen("datorii.in", "r");
    fout=fopen("datorii.out", "w");

    int i, n, m, a, b, c;
    fscanf(fin, "%d %d", &n, &m);
    for(i=1; i<=n; i++) {
        fscanf(fin, "%d", &v[i]);
        x=i;
        pos=i;
        Inserare(1,1,n);
    }
    for(i=0; i<m; i++) {
        fscanf(fin, "%d %d %d", &c, &a, &b);
        if(c==0) {
            v[a]=v[a]-b;
            x=a;
            pos=a;
            Inserare(1,1,n);
        }
        if(c==1) {
                s=0;
                si=a;
                sf=b;
                Interogare(1, 1, n);
                fprintf(fout, "%d\n", s);
        }
    }
}