HDU-Inversion

Inversion

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

Problem Description

Give an array A, the index starts from 1.
Now we want to know Bi=max(i∤j) Aj , 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

代码：

#include <iostream>
#include<cstdio>
#include<cmath>
#include<algorithm>
using namespace std;

struct book
{
    int shu,xb;
}s[100010];

bool cmp(book x,book y)
{
    return x.shu>y.shu;
}

int h[100010];
int main()
{
   int T,n,i;
   scanf("%d",&T);
   while(T--)
   {
       scanf("%d",&n);
       for(i=1;i<=n;++i)
       {
           scanf("%d",&s[i].shu);
           s[i].xb=i;
       }
       sort(s+1,s+i,cmp);
       for(int j=2;j<=n;j++)
       {
          for(i=1;i<=n;i++)
          {
              if(s[i].xb%j!=0)
                {
                    h[j]=s[i].shu;
                    break;
                }
          }
       }
       for(int j=2;j<n;j++)
            printf("%d ",h[j]);
       printf("%d\n",h[n]);
   }
    return 0;
}