Cod sursa(job #2225158)
| Utilizator | Data | 26 iulie 2018 10:43:38 | |
|---|---|---|---|
| Problema | Arbori de intervale | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.63 kb |
#include <fstream>
using namespace std;
ifstream f("arbint.in");
ofstream g("arbint.out");
int n, m, v[100001] , i, maxim, caz, a, b;
void MAX( int a, int b)
{
for ( i = a ; i <= b ; i++ )
if( maxim < v[i] )
maxim = v[i];
}
int main()
{
f >> n >> m;
for( i = 1 ; i <= n ; i++ )
{
f >> v[i];
}
while ( m-- )
{
f >> caz >> a >> b ;
if ( caz == 0 )
{
maxim = -1;
MAX( a, b);
g << maxim << "\n";
}
else
{
v[a] = v[b];
}
}
return 0;
}
