hdu6098--Inversion

Problem Description

Give an array A, the index starts from 1.
Now we want to know Bi=maxi∤jAj , i≥2 .

Input

The first line of the input gives the number of test cases T; T test cases follow.
Each case begins with one line with one integer n : the size of array A.
Next one line contains n integers, separated by space, ith number is Ai .

Limits
T≤20
2≤n≤100000
1≤Ai≤1000000000
∑n≤700000

Output

For each test case output one line contains n-1 integers, separated by space, ith number is Bi+1 .

 

Sample Input

  
  

   
   2
4
1 2 3 4
4
1 4 2 3
  
  

Sample Output

  
  

   
   3 4 3
2 4 4
  
  

 

题意

已知序列Ai，求序列Bi，使得Bi = max Aj，并且i%j != 0

分析

可以将序号和取值放到结构体中，按照数值从大到小排序

从头遍历，保证Bi%j!=0的第一个数一定是最大的Bj

代码

#include<cstdio>
#include<iostream>
#include<algorithm>
using namespace std;
struct A{
    int a,num;
}e[100000+10];
bool cmp(A a,A b)
{
    return a.a>b.a;
}
int main()
{
    int t;
    scanf("%d",&t);
    while(t--)
    {
        int n;
        scanf("%d",&n);
        for(int i=1;i<=n;i++)
        {
            int x;
            scanf("%d",&x);
            e[i].a=x;
            e[i].num=i;
        }
        sort(e+1,e+n+1,cmp);
        for(int i=2;i<=n;i++)
        {
            for(int j=1;j<=n;j++)
            {
                if(e[j].num%i!=0)
                {
                    if(i!=2)
                        cout<<" ";
                    cout<<e[j].a;
                    break;
                }
            }
        }
        cout<<endl;
    }
    return 0;
}

链接

http://acm.hdu.edu.cn/showproblem.php?pid=6098