Pagini recente » Cod sursa (job #153648) | Cod sursa (job #3203417) | Cod sursa (job #1990698) | Cod sursa (job #152330) | Cod sursa (job #2480948)
#include <fstream>
#include <climits>
using namespace std;
ifstream fin("arbint.in");
ofstream fout("arbint.out");
int n,sir[100005],aint[200005],a,b;
void creeare(int nod,int st,int dr)
{
if (st==dr)
{
aint[nod]=sir[st];
return;
}
int mij=(st+dr)/2;
creeare(2*nod,st,mij);
creeare(2*nod+1,mij+1,dr);
aint[nod]=max(aint[2*nod],aint[2*nod+1]);
}
int interogare(int nod,int st,int dr)
{
if (dr<a || st>b) return INT_MIN;
if (st>=a && dr<=b) return aint[nod];
int mij=(st+dr)/2;
return max(interogare(2*nod,st,mij),interogare(2*nod+1,mij+1,dr));
}
int main()
{
int m;
fin >> n >> m;
for (int i=1;i<=n;i++)
{
fin >> sir[i];
}
creeare(1,1,n);
for (int i=1;i<=m;i++)
{
int t;
fin >> t >> a >> b;
if (t==0)
{
fout << interogare (1,1,n);
fout << '\n';
}
else if (t==1)
{
sir[a]=b;
creeare(1,1,n);
}
}
}