链接：https://codeforces.ml/contest/1350/problem/BThere arennmodels in the shop numbered from11tonn, with sizess1,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 size...
链接：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 qu
最低0.47元/天 解锁文章
207
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
