Pagini recente » Cod sursa (job #4780) | Cod sursa (job #2866141) | Cod sursa (job #1906) | Cod sursa (job #2046959) | Cod sursa (job #2592302)
#include <fstream>
using namespace std;
ifstream cin ("arbint.in");
ofstream cout ("arbint.out");
const int INF = 1e9;
const int MAX = 1 << 18;
int t[MAX], a, b, poz, val;
void actualizare(int p, int st, int dr)
{
if(st == dr)
{
t[p] = val;
return;
}
int m = (st + dr) / 2;
if(poz <= m)
{
actualizare(2 * p, st, m);
}
else
{
actualizare(2* p + 1, m + 1, dr);
}
t[p] = max(t[2 * p], t[2 * p + 1]);
}
int interogare(int p, int st, int dr)
{
if(a <= st && dr <= b)
{
return t[p];
}
int m = (st + dr) / 2;
int maxst = -INF;
int maxdr = -INF;
if(a <= m)
{
maxst = interogare(2 * p, st, m);
}
if(b > m)
{
maxdr = interogare(2 * p + 1, m + 1, dr);
}
return max(maxst, maxdr);
}
int main()
{
int n, m, op;
cin>>n>>m;
for(int i=1;i<=n;i++)
{
cin >> val;
poz = i;
actualizare(1,1,n);
}
for(int i=1; i<=m; i++)
{
cin>>op;
if(op==0)
{
cin >>a>>b;
cout<<interogare(1, 1, n)<<"\n";
}
else
{
cin>>poz>>val;
actualizare(1,1,n);
}
}
return 0;
}