Pagini recente » Cod sursa (job #139930) | Cod sursa (job #1004347) | Cod sursa (job #2389833) | Cod sursa (job #3166766) | Cod sursa (job #934397)
Cod sursa(job #934397)
#include<fstream>
#include<cstdio>
#define inf 1000000001
using namespace std;
int a,b,poz,val,n;
int t[100001],v[30001];
ifstream in("schi.in");
inline int max(int a, int b)
{
if(a>b)
return a;
return b;
}
void actualizare(int p, int st, int dr,int a, int b)
{
if(a<=st&&dr<=b)
{
t[p]=;
return;
}
int m=(st+dr)/2;
if(a<=m)
actualizare(2*p,st,m,a,b);
if(a>m)
actualizare(2*p+1,m+1,dr,a,b);
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 m1=-inf,m2=-inf, m=(st+dr)/2;
if(a<=m)
m1=interogare(2*p,st,m);
if(b>m)
m2=interogare(2*p+1,m+1,dr);
return max(m1,m2);
}
int main()
{
freopen("schi.out","w",stdout);
int m,i,x;
bool p;
in>>n;
t[0]=2*n;
for(i=1;i<=n;++i)
{
in>>v[i];
if(t[i/2]%2==1&&i%2==0)
t[i]=t[i/2]/2+1;
else
t[i]=t[i/2]/2;
}
for(i=n;i>=1;--i)
{
poz=i;
val=v[i];
}
return 0;
}