Cod sursa(job #1993798)
Utilizator | Data | 23 iunie 2017 19:31:10 | |
---|---|---|---|
Problema | Arbori de intervale | Scor | 50 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.66 kb |
#include <fstream>
using namespace std ;
ifstream cin("arbint.in") ;
ofstream cout ("arbint.out") ;
int v [100001] ;
int main ()
{
int n , m ;
cin >> n >> m ;
for ( int i = 1 ; i <= n ; ++i) {
cin >> v[i] ;
}
for ( int j = 1 ; j <= m ; ++j) {
int x ;
int a ;
int b ;
int maxi = -1 ;
cin >> x >> a >> b ;
if ( x == 0 ) {
for ( int i = a ; i <=b ; ++i) {
if ( v[i] > maxi ) {
maxi = v[i] ;
}
}
cout << maxi << '\n';
}
else {
v[a] = b ;
}
}
return 0 ;
}