Pagini recente » Cod sursa (job #2700284) | Cod sursa (job #226523) | Cod sursa (job #536903) | Cod sursa (job #2715429) | Cod sursa (job #1472500)
#include <cstdio>
using namespace std;
const char iname[] = "arbint.in";
const char oname[] = "arbint.out";
const int MAXN = 100005;
int A[MAXN],n,m;
void read(){
scanf("%d %d\n", &n, &m);
for(int i = 0; i < n; ++i)
scanf("%d", A+i);
}
int getMax(int start, int end){
int maxim = -1;
for(int i = start; i <= end; i++)
if(A[i] > maxim) maxim = A[i];
return maxim;
}
void solve(){
int c,a,b;
for(int i = 0; i < m; ++i){
scanf("%d %d %d", &c, &a, &b);
if(c == 0) printf("%d\n", getMax(a-1,b-1));
if(c == 1) A[a-1] = b;
}
}
int main()
{
freopen(iname, "r", stdin);
freopen(oname, "w",stdout);
read();
solve();
return 0;
}