Cod sursa(job #457911)
Utilizator | Data | 22 mai 2010 00:09:10 | |
---|---|---|---|
Problema | Arbori de intervale | Scor | 40 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.54 kb |
#include <stdio.h>
#define szam 100001
int A[szam];
int main()
{
FILE *f1;
FILE *f2;
int n,m,kod,a,b,max;
f1=fopen("arbint.in","r");
f2=fopen("arbint.out","w");
fscanf(f1,"%d %d\n",&n,&m);
for (int i=1;i<=n;i++)
fscanf(f1,"%d",&A[i]);
fscanf(f1,"\n");
for (int i=1;i<=m;i++)
{
fscanf(f1,"%d %d %d\n",&kod,&a,&b);
if (kod==0)
{
max=-1;
for (int j=a;j<=b;j++)
if (A[j]>max)
max=A[j];
fprintf(f2,"%d\n",max);
}
else
A[a]=b;
}
fclose(f1);
fclose(f2);
return 0;
}