Clique in the Divisibility Graph（dp递推的应用) （上升子序列）

最新推荐文章于 2020-11-19 20:28:25 发布

WePlayDirty

最新推荐文章于 2020-11-19 20:28:25 发布

阅读量2k

点赞数

分类专栏： ××××××××dp×××××××× 文章标签： Clique in the Divisi dp 递推上升子序列

本文链接：https://blog.csdn.net/u013569304/article/details/47252573

版权

××××××××dp×××××××× 专栏收录该内容

19 篇文章 0 订阅

订阅专栏

Clique in the Divisibility Graph

Description

As you must know, the maximum clique problem in an arbitrary graph is NP-hard. Nevertheless, for some graphs of specific kinds it can be solved effectively.

Just in case, let us remind you that a clique in a non-directed graph is a subset of the vertices of a graph, such that any two vertices of this subset are connected by an edge. In particular, an empty set of vertexes and a set consisting of a single vertex, are cliques.

Let's define a divisibility graph for a set of positive integers A = {a₁, a₂, ..., a_n} as follows. The vertices of the given graph are numbers from set A, and two numbers a_i and a_j (i ≠ j) are connected by an edge if and only if either a_i is divisible by a_j, or a_j is divisible by a_i.

You are given a set of non-negative integers A. Determine the size of a maximum clique in a divisibility graph for set A.

Input

The first line contains integer n (1 ≤ n ≤ 10⁶), that sets the size of set A.

The second line contains n distinct positive integers a₁, a₂, ..., a_n (1 ≤ a_i ≤ 10⁶) — elements of subset A. The numbers in the line follow in the ascending order.

Output

Print a single number — the maximum size of a clique in a divisibility graph for set A.

Sample Input

Input

8
3 4 6 8 10 18 21 24

Output

Hint

In the first sample test a clique of size 3 is, for example, a subset of vertexes {3, 6, 18}. A clique of a larger size doesn't exist in this graph.

类似于求上升子序列问题
由于连除可能丢失数据 所以从后往前递推
求上升子序列也可以从前往后递推
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<string>
#include<list>
#include<stack>
#include<queue>
#include<cmath>
#include<algorithm>
#include<climits>
#include<map>
#include<set>
#include<vector>

using namespace std;

int st[1000010];

int dp[1000010];

int main()
{
    int n;
    scanf("%d",&n);
    int i;
    for(i=0;i<n;++i)
    {
        scanf("%d",&st[i]);
    }
    memset(dp,0,sizeof(dp));
    int j;
    int sum=0;
   for(i=n-1;i>=0;--i)
   {
       dp[st[i]]=1;
       for(j=2;st[i]*j<=st[n-1];++j)
       {
           dp[st[i]]=max(dp[st[i]],dp[st[i]*j]+1);
       }
       sum=max(sum,dp[st[i]]);
   }
    cout<<sum<<endl;
}