hdu6025dp前后缀和

Coprime Sequence

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 131072/131072 K (Java/Others)
Total Submission(s): 1045    Accepted Submission(s): 515


Problem Description
Do you know what is called ``Coprime Sequence''? That is a sequence consists of n positive integers, and the GCD (Greatest Common Divisor) of them is equal to 1.
``Coprime Sequence'' is easy to find because of its restriction. But we can try to maximize the GCD of these integers by removing exactly one integer. Now given a sequence, please maximize the GCD of its elements.
 

Input
The first line of the input contains an integer T(1T10), denoting the number of test cases.
In each test case, there is an integer n(3n100000) in the first line, denoting the number of integers in the sequence.
Then the following line consists of n integers a1,a2,...,an(1ai109), denoting the elements in the sequence.
 

Output
For each test case, print a single line containing a single integer, denoting the maximum GCD.
 

Sample Input
3 3 1 1 1 5 2 2 2 3 2 4 1 2 4 8
 

Sample Output
1 2 2
#include<cstdio>
#include<iostream>
#include<cstring>
#include<string>
#include<algorithm>
using namespace std;
const int INF=1e9+10;
const int MAXN=100010;
int a[MAXN];
int dph[MAXN];
int dpt[MAXN];
int mx;
int n;
int gcd(int a,int b)
{
	return b==0?a:gcd(b,a%b);
}
int main()
{
	int t;
	scanf("%d",&t);
	while(t--)
	{
		scanf("%d",&n);	
		for(int i=0;i<n;i++)
		{
			scanf("%d",&a[i]);
		}
		dph[0]=a[0];	
        for(int i=1;i<n;i++)
        {
        	dph[i]=gcd(dph[i-1],a[i]);
		}
		dpt[n-1]=a[n-1];
		for(int i=n-2;i>=0;i--)
		{
			dpt[i]=gcd(dpt[i+1],a[i]);
		}
		int mx=0;
		if(mx<dpt[1]) mx=dpt[1];
		if(mx<dph[n-2]) mx=dph[n-2];
		for(int i=1;i<n-1;i++)
		{
			if(mx<gcd(dph[i-1],dpt[i+1]))
			{
				mx=gcd(dph[i-1],dpt[i+1]);
			}
		}
		printf("%d\n",mx);
	}
} 

展开阅读全文

没有更多推荐了,返回首页