hdu 4630 No Pain No Game(树状数组）

No Pain No Game

Time Limit: 4000/2000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 1809    Accepted Submission(s): 775

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 ₁, a ₂, ..., 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 ₁, a ₂, ..., a _n.
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

 

 

Author

WJMZBMR

 

 

Source

2013 Multi-University Training Contest 3

 

 

题意：给定一个n个元素的数列，对于每组查询l,r，在区间［l,r］内的最大公约数是多少。

转载一个题解，说得比较清楚：http://blog.csdn.net/qq564690377/article/details/9674355

 

/*************************************************************************
    > File Name: code/hdu/4630.cpp
    > Author: 111qqz
    > Email: [email protected] 
    > Created Time: 2015年08月11日 星期二 17时47分01秒
 ************************************************************************/

#include
#include
#include
#include
#include
#include
#include<string>
#include

 

转载于:https://www.cnblogs.com/111qqz/p/4721811.html