hdu6098[RMQ+筛法] 2017多校6

/*hdu6098[RMQ+筛法] 2017多校6*/
#include <bits/stdc++.h>
using namespace std;
int T, n, st[][], len[], a[];
void st_init() {
    len[] = -;
    for (int i = ; i <= n; i++) {
        st[i][] = a[i];
        len[i] = (i & (i - )) ==  ? len[i - ] +  : len[i - ];
    }
    for (int j = ; j <= len[n]; j++) {
        for (int i = ; i + ( << j) -  <= n; i++) {
            st[i][j] = max(st[i][j - ], st[i + ( << (j - ))][j - ]);
        }
    }
}
int query(int l, int r) {
    int k = len[r - l + ];
    return max(st[l][k], st[r - ( << k) + ][k]);
}
int main() {
    scanf("%d", &T);
    while (T--) {
        scanf("%d", &n);
        for (int i = ; i <= n; i++) {
            scanf("%d", &a[i]);
        }
        st_init();
        for (int i = ; i <= n; i++) {
            int ans = ;
            for (int j = ; j < n; j += i) {
                //cout<<"["<<j+1<<", "<<min(n, j + i - 1)<<"]\n";
                ans = max(query(j + , min(n, j + i - )), ans);
            }
            if(i>) printf(" ");
            printf("%d", ans);
        }
        puts("");
    }
    return ;
}