Submission #61593825

Source Code Expand

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
#include <bits/stdc++.h>
using namespace std;
const int N=5e5+1;
int n,a[N],t[N<<2],tag[N<<2];
inline int ls(int p)
{
  return p<<1;
}
inline int rs(int p)
{
  return p<<1|1;
}
inline void addtag(int p,int pl,int pr,int x)
{
  t[p]+=(pr-pl+1)*x;
  tag[p]+=x;
}
inline void push_up(int p)
{
  t[p]=t[ls(p)]+t[rs(p)];
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

#include <bits/stdc++.h>
using namespace std;
const int N=5e5+1;
int n,a[N],t[N<<2],tag[N<<2];
inline int ls(int p)
{
	return p<<1;
}
inline int rs(int p)
{
	return p<<1|1;
}
inline void addtag(int p,int pl,int pr,int x)
{
	t[p]+=(pr-pl+1)*x;
	tag[p]+=x;
}
inline void push_up(int p)
{
	t[p]=t[ls(p)]+t[rs(p)];
}
inline void push_down(int p,int pl,int pr)
{
	int m=(pl+pr)>>1;
	addtag(ls(p),pl,m,tag[p]);
	addtag(rs(p),m+1,pr,tag[p]);
	tag[p]=0;
}
void bulid(int p,int pl,int pr)
{
	if(pl==pr)
	{
		t[p]=a[pl];
		return;
	}
	int m=(pl+pr)>>1;
	bulid(ls(p),pl,m);
	bulid(rs(p),m+1,pr);
	push_up(p);
}
void update(int l,int r,int p,int pl,int pr,int x)
{
	if(l<=pl&&pr<=r)
	{
		addtag(p,pl,pr,x);
		return;
	}
	int m=(pl+pr)>>1;
	push_down(p,pl,pr);
	if(l<=m)	update(l,r,ls(p),pl,m,x);
	if(m<r)		update(l,r,rs(p),m+1,pr,x);
	push_up(p);
}
int query(int l,int r,int p,int pl,int pr)
{
	if(l<=pl&&pr<=r)	return t[p];
	int m=(pl+pr)>>1,ans=0;
	push_down(p,pl,pr);
	if(l<=m)	ans+=query(l,r,ls(p),pl,m);
	if(m<r)		ans+=query(l,r,rs(p),m+1,pr);
	return ans;
}
int main()
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	cin>>n;
	for(int i=1;i<=n;i++)	cin>>a[i];
	bulid(1,1,n);
	for(int i=1;i<=n;i++)
	{
		int x=query(i,i,1,1,n);
		update(i+1,min(n,i+x),1,1,n,1);
		cout<<i+x-min(n,i+x)<<' ';
	}
	return 0;
}

Submission Info

Judge Result