Cod sursa(job #485679)
| Utilizator | Data | 19 septembrie 2010 10:26:45 | |
|---|---|---|---|
| Problema | Arbori de intervale | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.39 kb |
#include <iostream>
using namespace std;
int main(void) {
freopen("arbint.in","r",stdin);
freopen("arbint.out","w",stdout);
int i,m,n,a,b,x,j,max;
cin>>n>>m;
int v[n];
for (i=0;i<n;i++)
cin>>v[i];
for (i=0;i<m;i++) {
cin>>x>>a>>b;
if (!x) {
max=v[a];
for (j=a-1;j<b;j++)
if (v[j]>max) max=v[j];
cout<<max<<endl;
}else{
v[a-1]=b;
}
}
}
