Cod sursa(job #1600373)

Utilizator deliricnagisa deliric Data 14 februarie 2016 22:11:11
Problema Arbori de intervale Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 2 kb
#include <fstream>
using namespace std;
class InputReader {
    public:
        InputReader() {}
        InputReader(const char *file_name) {
            input_file = fopen(file_name, "r");
            cursor = 0;
            fread(buffer, SIZE, 1, input_file);
        }
        inline InputReader &operator >>(int &n) {
            while(buffer[cursor] < '0' || buffer[cursor] > '9') {
                advance();
            }
            n = 0;
            while('0' <= buffer[cursor] && buffer[cursor] <= '9') {
                n = n * 10 + buffer[cursor] - '0';
                advance();
            }
            return *this;
        }
    private:
        FILE *input_file;
        static const int SIZE = 1 << 17;
        int cursor;
        char buffer[SIZE];
        inline void advance() {
            ++ cursor;
            if(cursor == SIZE) {
                cursor = 0;
                fread(buffer, SIZE, 1, input_file);
            }
        }
}f("arbint.in");
ofstream g("arbint.out");
int a,b,val,maxim,poz,i,n,m,caz,AI[300007];
void update (int nod, int left ,int right)
{
    if(left==right)
    {
        AI[nod]=val;
        return;
    }

    int mij=(left+right)/2;
    if(poz<=mij) update(2*nod,left,mij);
        else update(2*nod+1,mij+1,right);

    AI[nod]=max(AI[2*nod],AI[2*nod+1]);
}
void query(int nod,int left,int right)
{
    if(a<=left&&right<=b)
    {
        maxim=max(AI[nod],maxim);
        return;
    }
    int mij=(left+right)/2;
    if(a<=mij) query(2*nod,left,mij);
    if(b>mij) query(2*nod+1,mij+1,right);
}
int main()
{
    f>>n>>m;
    for(i=1;i<=n;++i)
    {
        poz=i;
        f>>val;
        update(1,1,n);
    }
    while(m--)
    {
        f>>caz>>a>>b;
        if(!caz)
        {
            maxim=0;
            query(1,1,n);
            g<<maxim<<'\n';
        }
        else
        {
            poz=a;
            val=b;
            update(1,1,n);
        }
    }
    g.close();
    return 0;
}