delete pics to save space

2.12003.cpp

@@ -0,0 +1,68 @@
+#include<cstdio>
+#include<algorithm>
+using namespace std;
+const int maxn=300010;
+const int SIZE=4096;
+int n,m,u,L,R,v,p,A[maxn],block[maxn/SIZE+1][SIZE];
+void init()
+{
+	scanf("%d%d%d",&n,&m,&u);
+	int b=0,j=0;
+	for(int i=0;i<n;i++)
+	{
+		scanf("%d",&A[i]);
+		block[b][j]=A[i];
+		if(++j==SIZE) { b++; j=0; }
+	}
+	for(int i=0;i<b;i++) sort(block[i],block[i]+SIZE);
+	if(j) sort(block[b],block[b]+j);
+}
+int query(int L,int R,int v)
+{
+	int lb=L/SIZE,rb=R/SIZE,cnt=0;
+	if(lb==rb)
+		for(int i=L;i<=R;i++) cnt+=(A[i]<v);
+	else
+	{
+		for(int i=L;i<(lb+1)*SIZE;i++) cnt+=(A[i]<v);
+		for(int i=rb*SIZE;i<=R;i++) cnt+=(A[i]<v);
+		for(int b=lb+1;b<rb;b++)
+			cnt+=lower_bound(block[b],block[b]+SIZE,v)-block[b];
+	}
+	return cnt;
+}
+void change(int p,int x)
+{
+	if(A[p]==x) return;
+	int old=A[p],pos=0,*B=&block[p/SIZE][0];
+	A[p]=x;
+	while(B[pos]<old) pos++;
+	B[pos]=x;
+	if(x>old)
+		while(pos<SIZE-1&&B[pos]>B[pos+1])
+		{
+			swap(B[pos+1],B[pos]);
+			pos++;
+		}
+	else
+		while(pos>0&&B[pos]<B[pos-1])
+		{
+			swap(B[pos-1],B[pos]);
+			pos--;
+		}
+}
+int main()
+{
+#ifdef local
+	freopen("pro.in","r",stdin);
+#endif
+	init();
+	while(m--)
+	{
+		scanf("%d%d%d%d",&L,&R,&v,&p);L--;R--;p--;
+		int k=query(L,R,v);
+		change(p,(long long)u*k/(R-L+1));
+	}
+	for(int i=0;i<n;i++) printf("%d\n",A[i]);
+	return 0;
+}