Cod sursa(job #875832)
Utilizator | rusu bogdan bogdan1515 | Data | 10 februarie 2013 20:44:24 |
---|---|---|---|
Problema | Arbori de intervale | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.47 kb |
#include<iostream>
#include<fstream>
#include<cstdlib>
using namespace std;
int main()
{
ifstream f("interval.in");
ofstream g("interval.out");
long n,m,*a;
f>>n>>m;
int op;
long x,y;
a=(long*)malloc(n*sizeof(long));
for( int i=1;i<=n;i++ )
f>>a[i];
for( int i=1;i<=m;i++)
{
f>>op>>x>>y;
if( op == 1 )
a[x]=y;
else
{ int max=0;
for( int j=x; j<=y; j++)
if( a[j]>max)
max=a[j];
g<<max<<endl;
}
}
return 0;
}