Pagini recente » Cod sursa (job #2796694) | Cod sursa (job #135258) | Cod sursa (job #3271097) | Cod sursa (job #2898146) | Cod sursa (job #2282242)
#include <fstream>
using namespace std;
//ifstream fin("data.in");
//ofstream fout("data.out");
ifstream fin("farfurii.in");
ofstream fout("farfurii.out");
typedef long long ll;
const int N=100000+5;
int n;
ll cnt;
int v[N];
int aib[N];
inline void add(int p,int x)
{
for(int i=p;i<=n;i+=i&(-i))
{
aib[i]+=x;
}
}
inline int prefix(int p)
{
int ans=0;
for(int i=p;i>=1;i-=i&(-i))
{
ans+=aib[i];
}
return ans;
}
int main()
{
fin>>n>>cnt;
for(int i=1;i<=n;i++)
{
ll lft=n-i;
ll x=lft*(lft-1)/2;
if(cnt<=x)
{
v[i]=0;
}
else
{
v[i]=cnt-x;
}
cnt-=v[i];
}
for(int i=1;i<=n;i++)
{
v[i]++;
int r=0,pas=(1<<16);
while(pas)
{
if(r+pas<=n)
{
int id=r+pas;
if(id+prefix(id)<v[i])
{
r+=pas;
}
}
pas/=2;
}
r++;
add(r,-1);
fout<<r<<" ";
}
fout<<"\n";
return 0;
}