Cod sursa(job #824914)
| Utilizator | Data | 27 noiembrie 2012 10:20:20 | |
|---|---|---|---|
| Problema | Arbori de intervale | Scor | 40 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.54 kb |
#include <iostream>
#include <stdio.h>
using namespace std;
FILE *f=fopen("arbint.in","r");
FILE *g=fopen("arbint.out","w");
int v[100000],i,j,mx,n,m,x,a,b;
int main()
{
fscanf(f,"%d%d",&n,&m);
for (i=1;i<=n;i++)
fscanf(f,"%d",&v[i]);
for (i=1;i<=m;i++){
fscanf(f,"%d%d%d",&x,&a,&b);
if (x==1) {v[a]=b;}
if (x==0)
{
mx=0;
for (j=a;j<=b;j++)
if (v[j]>mx) mx=v[j];
fprintf(g,"%d\n",mx);
}
}
return 0;
}
