90pts，#1点WA了，蒟蒻求助

#include<bits/stdc++.h>
#define int long long
using namespace std;
int n,a[1000001],ans[1000001],now[1000001],maxn,pts;
signed main(){
	cin>>n>>a[1];
	ans[a[1]]++;
	now[a[1]]=1;
	for(int i=2;i<=n;i++){
		a[i]=(a[i-1]*3703+1047)%n+1;
		if(a[i]==a[i-1]){
			if(now[a[i]]<3) ans[a[i]]+=now[a[i]];
			else ans[a[i]]+=3;
		}
		else ans[a[i]]++;
		now[a[i]]++;
	}
	for(int i=1;i<=n;i++) maxn=max(maxn,ans[i]);
	cout<<maxn;
}