Cod sursa(job #2058547)

Utilizator gundorfMoldovan George gundorf Data 5 noiembrie 2017 19:24:41
Problema Arbori de intervale Scor 50
Compilator cpp Status done
Runda Arhiva educationala Marime 1.47 kb
#include <iostream>
#include <fstream>
#define Nmax 100005
#include <cmath>
using namespace std;
ifstream fin("arbint.in");
ofstream fout("arbint.out");
int n,m,v[Nmax];
int intervale[Nmax],lg;
void Citire ()
{
    int i;
    fin>>n>>m;
    for (i=0; i<n; i++)
        fin>>v[i];
}
void Initializare_intervale ()
{
    int i;
    for (i=0; i<n; i++)
    if (v[i]>intervale[i/lg]) intervale[i/lg]=v[i];
}

void Max_a_b (int y,int z)
{ int j,maxi;
     y--;
        z--;
        maxi=0;
        for(j=y/lg+1;j<=z/lg-1;j++)
        if(intervale[j]>maxi) maxi=intervale[j];
 if(y/lg!=z/lg)
        {for(j=y;j/lg==y/lg;j++)
         if(v[j]>maxi) maxi=v[j];

         for(j=z;j/lg==z/lg&&j;j--)
          if(v[j]>maxi) maxi=v[j];
       fout<<maxi<<"\n";
        }
      else {for(j=y;j<=z;j++) if(v[j]>maxi)  maxi=v[j];
            fout<<maxi<<"\n";
           }

}

void Update_a_b (int y,int z)
{
   int j;
     y--;
              v[y]=z;intervale[y/lg]=0;
             for(j=y/lg*lg;j<=y/lg*lg+lg-1;j++)
               if(v[j]>intervale[y/lg]) intervale[y/lg]=v[j];
}
int main()
{
    int i,x,y,z,j;
    Citire();
      lg=(int)sqrt(n);
    Initializare_intervale();
    for (i=1; i<=m; i++)
    {
        fin>>x>>y>>z;
        if (x==0) Max_a_b(y,z);
        else
        {
            Update_a_b(y,z);
            /*for (j=1;j*lg<=n;j++)
            fout<<intervale[j]<<" ";
            fout<<"\n";*/
        }
    }

    return 0;
}