Pagini recente » Cod sursa (job #297795) | Cod sursa (job #2947189) | Cod sursa (job #2396223) | Cod sursa (job #2124253) | Cod sursa (job #2406263)
#include <fstream>
using namespace std;
int a,b,poz,arb[100001],val;
int query(int p, int st, int dr)
{
if(a<=st && dr<=b) return arb[p];
int m=(st+dr)/2,mst=-1,mdr=-1;
if(a<=m) mst=query(2*p,st,m);
if(b>m) query(2*p+1,m+1,dr);
return max(mst,mdr);
}
void update(int p,int st, int dr)
{
if(st==dr)
{arb[p]=val;
return;
}
int m=(st+dr)/2;
if(poz<=m) update(2*p,st,m);
else update(2*p+1,m+1,dr);
arb[p]=max(arb[2*p],arb[2*p+1]);
}
int main()
{
return 0;
}