Pagini recente » Cod sursa (job #2124343) | Cod sursa (job #1194983) | Cod sursa (job #1737512) | Cod sursa (job #2000121) | Cod sursa (job #2225155)
#include <fstream>
using namespace std;
ifstream f("arbint.in");
ofstream g("arbint.out");
int n, m, v[100010] , i, maxim, caz, a, b;
int main()
{
f >> n >> m;
for( i = 1 ; i <= n ; i++ )
f >> v[i];
while ( m-- )
{
f >> caz;
if ( caz == 0 )
{
f >> a >> b;
maxim = v[a];
for( i = a+1 ; i <= b ; i++)
if ( maxim <= v[i] )
maxim = v[i];
g << maxim << "\n";
}
else
{
f >> a >> b;
v[a] = v[b];
}
}
return 0;
}