Codeforcrs 264B Good Sequences

题意：最长非降子序列+不互质。转化为公因子的公共次数。

#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
#define MAXN 500010
int shu[MAXN],dp[MAXN],vis[MAXN],num=0,su[MAXN],b[MAXN],d[MAXN];
void dabiao()
{
	memset(su,0,sizeof(su));
	memset(vis,0,sizeof(vis));
	for(int i=2;i<500010;i++)
	{
		if(vis[i]) continue;
		su[num++]=i;
		for(int j=i+i;j<500010;j+=i)
		{
			vis[j]=1;
		}
	}
}
int main()
{
	int n,m,i,j,k,ans;
	dabiao();
	while(scanf("%d",&n)!=EOF)
	{		
		memset(dp,0,sizeof(dp));
		for(i=1;i<=n;i++)
		{
			scanf("%d",&shu[i]);
			dp[i]=1;
		}
		ans=0;	
		memset(b,0,sizeof(b));
		memset(d,0,sizeof(d));
		for(i=1;i<=n;i++)
		{
			k=0;
			for(j=0;su[j]<=shu[i]&&j<=num;j++)
			{
				while(shu[i]%su[j]==0)
				{
					if(dp[i]<=d[j]+1) dp[i]=d[j]+1;
					b[k++]=j;
					shu[i]/=su[j];
				}
			}
				for(int h=0;h<k;h++)
				{
					if(d[b[h]]<=dp[i]) d[b[h]]=dp[i];
				}
			if(ans<dp[i]) ans=dp[i];
		}
		printf("%d\n",ans);
	}
	return 0;
}