Cod sursa(job #152861)
Utilizator | Sofineti Mihai Sofineti | Data | 9 martie 2008 21:07:16 |
---|---|---|---|
Problema | Arbori de intervale | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include<stdio.h>
long a[10001],n,m,max,x,y,ok,i,j;
int main(){
freopen("arbint.in","r",stdin);
freopen("arbint.out","w",stdout);
scanf("%ld %ld",&n,&m);
for(i=1;i<=n;i++)
scanf("%ld",&a[i]);
for(i=1;i<=m;i++)
{
scanf("%ld %ld %ld",&ok,&x,&y);
if(ok==0){ max=-1;
for(j=x;j<=y;j++) if(a[i]>max)max=a[i];
printf("%ld\n ",max);
}
else if(ok==1) a[x]=y;
}
return 0;
}