id=45786" style="color:blue; text-decoration:none">HDU - 4630
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. 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 1, a 2, ..., 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
Sample Output
题意:求解给予[i , j]区间内随意两个值的最大gcd,而且输出它
因为数据一一去处理,复杂度肯定很大,所以要进行离线处理
详细内容,提供一个大牛博客:http://m.blog.csdn.net/blog/u010033217/38156507
#include <cstdio> |
相关文章
- 11-01E - No Pain No Game 线段树 离线处理 区间排序
- 11-01HDU 4288 Coder 【线段树+离线处理+离散化】
- 11-01HDU 4630 No Pain No Game 树状数组+离线操作
- 11-01HDU 4630 No Pain No Game 树状数组+离线查询
- 11-01【HDU4630 No Pain No Game】 dp思想+线段树的离线操作
- 11-01HDU - 4630 No Pain No Game (线段树 + 离线处理)
- 11-01hdu 4630 No Pain No Game(线段树+离线操作)
- 11-01HDU 4630 No Pain No Game (线段树+离线)
- 11-01HDU 4630 No Pain No Game 线段树 和 hdu3333有共同点
- 11-01HDU 4605 Magic Ball Game (在线主席树|| 离线 线段树)