Problem M
Time Limit : 4000/2000ms (Java/Other) Memory Limit : 65536/32768K (Java/Other)
Total Submission(s) : 7 Accepted Submission(s) : 3
Problem Description
Life is a game,and you lose it,so you suicide.
But you can not kill yourself before you solve this problem:
Given you a sequence of number a 1, a 2, ..., a n.They are also a permutation of 1...n.
You need to answer some queries,each with the following format:
If we chose two number a,b (shouldn't be the same) from interval [l, r],what is the maximum gcd(a, b)? If there's no way to choose two distinct number(l=r) then the answer is zero.
But you can not kill yourself before you solve this problem:
Given you a sequence of number a 1, a 2, ..., a n.They are also a permutation of 1...n.
You need to answer some queries,each with the following format:
If we chose two number a,b (shouldn't be the same) from interval [l, r],what is the maximum gcd(a, b)? If there's no way to choose two distinct number(l=r) then the answer is zero.
Input
First line contains a number T(T <= 5),denote the number of test cases. Then follow T test cases. For each test cases,the first line contains a number n(1 <= n <= 50000). The second line contains n number a[sub]1[/sub], a[sub]2[/sub], ..., a[sub]n[/sub]. The third line contains a number Q(1 <= Q <= 50000) denoting the number of queries. Then Q lines follows,each lines contains two integer l, r(1 <= l <= r <= n),denote a query.
Output
For each test cases,for each query print the answer in one line.
Sample Input
1 10 8 2 4 9 5 7 10 6 1 3 5 2 10 2 4 6 9 1 4 7 10
Sample Output
5 2 2 4 3
题意:
题目给出n个数,每个数的范围是1~n的。
n<=50000;
然后查询m次,m<=5000
每次查询[l,r]区间内,两个数的gcd的最大值.
思路:
n个数,如果把n个数的约数全部写出来。查询[l,r]之间的gcd的最大值,就相当于找一个最大的数,使得这个数是[l,r]之间至少是两个的约数。对于一个数n,在sqrt(n)内可以找出所有约数。我的做法是对查询进行离线处理。将每个查询按照 l 从大到小排序。然后 i 从 n~0 ,表示从后面不断扫这些数。
对于数a[i],找到a[i]的所有约数,对于约数x,在x上一次出现的位置加入值x.
这样的查询的时候,只要差值前 r 个数的最大值就可以了。
代码:
#include <algorithm>
#include <cstring>
#include <iostream>
#include <string>
#include <cstdio>
#define maxn 50010
using namespace std;
int c[maxn];
int a[maxn];
int b[maxn];
int ans[maxn];
int n;
int lowbit(int x)
{
return x&(-x);
}
void add(int i,int val)
{
while(i <= n)
{
c[i] = max(c[i],val);
i += lowbit(i);
}
}
int Max(int i)
{
int res = 0;
while(i > 0)
{
res = max(res,c[i]);
i -= lowbit(i);
}
return res;
}
struct Node
{
int l,r;
int index;
}node[maxn];
bool cmp(Node a,Node b)
{
return a.l > b.l;
}
int main()
{
int T;
int m;
int l,r;
scanf("%d",&T);
while(T--)
{
scanf("%d",&n);
for(int i = 1;i <= n;i++)
scanf("%d",&a[i]);
scanf("%d",&m);
for(int i = 0;i < m;i++)
{
scanf("%d%d",&node[i].l,&node[i].r);
node[i].index = i;
}
sort(node,node+m,cmp);
int i = n;
int j = 0;
memset(b,0,sizeof(a));
memset(c,0,sizeof(c));
while(j < m)
{
while(i > 0 && i>= node[j].l)
{
for(int k =1;k*k <= a[i];k++)
{
if(a[i]%k == 0)
{
if(b[k]!=0)
{
add(b[k],k);
}
b[k] = i;
if(k != a[i]/k)
{
if(b[a[i]/k]!=0)
{
add(b[a[i]/k],a[i]/k);
}
b[a[i]/k]=i;
}
}
}
i--;
}
while(j < m && node[j].l > i)
{
ans[node[j].index]=Max(node[j].r);
j++;
}
}
for(int i = 0;i < m;i++)
printf("%d\n",ans[i]);
}
return 0;
}