HDU 6098 Inversion【】

Inversion

Time Limit: 4000/2000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)
Total Submission(s): 393    Accepted Submission(s): 273

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
  
  

 

Source

2017 Multi-University Training Contest - Team 6

 

思路：将Aa数组按值从大到小排序，对于每个下标$i$暴力找到最大的不被$i$整除的数。

#include<iostream>
#include<cstdio>
#include<cstring>
#include<string>
#include<cmath>
#include<queue>
#include<stack>
#include<vector>
#include<map>
#include<set>
#include<algorithm>
using namespace std;
#define ll long long
#define ms(a,b)  memset(a,b,sizeof(a))
#define maxn 510
const int M=1e6+10;
const int MM=2e3+10;
const int inf=0x3f3f3f3f;
const int mod=998244353;
const double eps=1e-10;
int n,m,k;
struct node
{
    int num;
    int id;
}a[M];
bool cmp(node a,node b)
{
    return a.num>b.num;
}

int main()
{
   int t;
   scanf("%d",&t);
   while(t--){
    scanf("%d",&n);
    for(int i=1;i<=n;i++){
        scanf("%d",&a[i].num);
        a[i].id=i;
    }
    sort(a+1,a+n+1,cmp);
    bool flag=1;
    for(int i=2;i<=n;i++){
        k=1;
        while(a[k].id%i==0){
            k++;
        }
        if(flag){printf("%d",a[k].num);flag=0;}
        else {printf(" %d",a[k].num);}
      }
      printf("\n");
    }
    return 0;
}