附https://blog.csdn.net/aarongzk/article/details/51661600#commentBox
为什么能跳过染完的区间 因为用了find(x)!
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cmath>
#include<cstring>
#include<algorithm>
#define F(i,j,n) for(int i=j;i<=n;i++)
#define D(i,j,n) for(int i=j;i>=n;i--)
#define ll long long
#define N 1000005
#define M 10000005
using namespace std;
int n,m,p,q,a[N],f[N];
int find(int x)
{
if(f[x]==x) return x;
return f[x]=find(f[x]);
}
int main()
{
cin>>n>>m>>p>>q;
F(i,1,n+1) f[i]=i;
for(int i=m;i>=1;i--)
{
int x=(i*p+q)%n+1,y=(i*q+p)%n+1;
if (x>y) swap(x,y);
for(int j=find(x);j<=y;j=find(j)) a[j]=i,f[j]=j+1;
}
for(int i=1;i<=n;i++) printf("%d\n",a[i]);
return 0;
}