B. Orac and Models

链接：https://codeforces.ml/contest/1350/problem/B

There are nn models in the shop numbered from 11 to nn, with sizes s1,s2,…,sns1,s2,…,sn.

Orac will buy some of the models and will arrange them in the order of increasing numbers (i.e. indices, but not sizes).

Orac thinks that the obtained arrangement is beatiful, if for any two adjacent models with indices ijij and ij+1ij+1 (note that ij<ij+1ij<ij+1, because Orac arranged them properly), ij+1ij+1 is divisible by ijij and sij<sij+1sij<sij+1.

For example, for 66 models with sizes {3,6,7,7,7,7}{3,6,7,7,7,7}, he can buy models with indices 11, 22, and 66, and the obtained arrangement will be beautiful. Also, note that the arrangement with exactly one model is also considered beautiful.

Orac wants to know the maximum number of models that he can buy, and he may ask you these queries many times.

Input

The first line contains one integer t (1≤t≤100)t (1≤t≤100): the number of queries.

Each query contains two lines. The first line contains one integer n (1≤n≤100000)n (1≤n≤100000): the number of models in the shop, and the second line contains nn integers s1,…,sn (1≤si≤109)s1,…,sn (1≤si≤109): the sizes of models.

It is guaranteed that the total sum of nn is at most 100000100000.

Output

Print tt lines, the ii-th of them should contain the maximum number of models that Orac can buy for the ii-th query.

Example

input

Copy

4
4
5 3 4 6
7
1 4 2 3 6 4 9
5
5 4 3 2 1
1
9

output

Copy

Note

In the first query, for example, Orac can buy models with indices 22 and 44, the arrangement will be beautiful because 44 is divisible by 22 and 66 is more than 33. By enumerating, we can easily find that there are no beautiful arrangements with more than two models.

In the second query, Orac can buy models with indices 11, 33, and 66. By enumerating, we can easily find that there are no beautiful arrangements with more than three models.

In the third query, there are no beautiful arrangements with more than one model.

代码：

#include<iostream>
#include<cstring>
#include<cstdio>
#include<queue>
#include<cstdlib>
#include<cmath>
#include<stack>
#include<map>
#include<algorithm>
using namespace std;
#define ll long long
#define lb long double
#define INF 0x3f3f3f3f
#define maxn 200010
ll n,k,l,t,x,s;
ll a[200001];
ll dp[100001];
vector<ll>m[100001];
int main()
{cin>>t;for(int i=2;i<=100000;i++){x=sqrt(i);for(int j=1;j<=x;j++){if(i%j==0){m[i].push_back(j);if(j*j!=i&&j!=1)m[i].push_back(i/j);}}}while(t--){cin>>n;for(int i=1;i<=n;i++){cin>>a[i];dp[i]=1;}s=1;for(int i=2;i<=n;i++){for(int j=0;j<m[i].size();j++){//cout<<m[i][j]<<" ";if(a[i]>a[m[i][j]])dp[i]=max(dp[i],dp[m[i][j]]+1);}//cout<<endl;s=max(s,dp[i]);}cout<<s<<endl;}
}

B. Orac and Models相关推荐

1350B. Orac and Models
B. Orac and Models:题目题意:找一个最长的串,后一个下标可以整除前一个,并且a[i]<a[i+1] #include <bits/stdc++.h> using ...
CodeForces - 1350B Orac and Models(dp)
题目链接:点击查看题目大意:给出一个长度为 n 的数列,求出最长上升子序列的长度,满足前一个的下标是后一个下标的因子题目分析:读懂题后不难发现这是 n * n 最长不下降子序列模板题目的变形题,只 ...
B. Orac and Models（cf）dp
原题链接:Problem - 1350B - Codeforces 题意: 求一个下标单调递增且互为倍数,即满足j > i且j为i的倍数,并且s[i] < s[j]的最长子序列. 其实和最 ...
codeforces 1350.Div2 A-D Orac and xxx
目录 A.Orac and Fac 1:问题描述 2:问题分析: 3:代码: B.Orac and Models 1:问题描述 2:问题分析: 3:代码 C.Orac and LCM 1:问题描述 2 ...
Codeforces Round #641 (Div. 2)A~E题解（数论场）
题目大意就是给你一个数执行k次操作,每次加上这个数的最小质因子(除了一以外)变成一个新的数,问最后的数是多少解题思路:很明显如果一开始是偶数的话就会一直加2加2,如果是奇数的话先找到这个数的质因子一 ...
编译ONNX模型Compile ONNX Models
编译ONNX模型Compile ONNX Models 本文是一篇介绍如何使用Relay部署ONNX模型的说明. 首先,必须安装ONNX包. 一个快速的解决方案是安装protobuf编译器,然后 pi ...
Cannot find snapshot in models/VGGNet/VOC0712/SSD_300x300
错误描述: 执行 python examples/ssd/ssd_pascal.py 报错: Cannot find snapshot in models/VGGNet/VOC0712/SSD_300 ...
tensorflow models 工程解析
项目地址:https://github.com/tensorflow/models 下面列表中的是否支持 tf2.0 来源于 https://github.com/tensorflow/models/ ...
三维植物树木模型 Maxtree – Plant Models Vol 74
maxtree–工厂模型第74卷大小解压后:2.34G 信息: 植物模型第74卷是高质量的三维植物模型的集合.包括12个物种,共72个单一模式. 获取地址:三维植物树木模型 Maxtree – Pl ...

B. Orac and Models

B. Orac and Models相关推荐

最新文章

热门文章