【Codeforces Round #641 (Div. 2) 】B - Orac and Models

B - Orac and Models

#include<bits/stdc++.h>
#define rep(i,b) for(int i=1;i<=b;i++)
#define drep(i,b) for(int i=b;i>=1;i--)
#define Rep(i,a,b) for(int i=a;i<=b;i++)
#define pr pair<int,int>
#define ff first
#define ss second
#define int long long
#define endl '\n'
using namespace std;
const int N=2e5+5;
const int mod=1e9+7;
int n,m,k,t,x,y,z;

int a[N],vis[N];

int dfs(int k) {
    if(vis[k]) return vis[k];
    for(int i=k;i<=n;i+=k) {
        if(a[i]>a[k]) vis[k]=max(dfs(i),vis[k]);
    }
    return ++vis[k];
}

void solve(int ans=0) {
    cin>>n;
    rep(i,n) cin>>a[i];
    rep(i,n) vis[i]=0;
    rep(i,n) {
        ans=max(dfs(i),ans);
    }
    cout<<ans<<endl;
}

#undef int
int main() {
    ios::sync_with_stdio(false);
    int T;cin>>T;
    while(T--)
        solve();
}