CodeForces 566F DP 查找所有整除关系的集合中元素的最大个数
来源:互联网 发布:mac mini 2016会更新吗 编辑:程序博客网 时间:2024/05/04 06:50
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 = {a1, a2, ..., an} as follows. The vertices of the given graph are numbers from setA, and two numbers ai andaj (i ≠ j) are connected by an edge if and only if eitherai is divisible byaj, oraj is divisible byai.
You are given a set of non-negative integers A. Determine the size of a maximum clique in a divisibility graph for setA.
Input
The first line contains integer n (1 ≤ n ≤ 106), that sets the size of setA.
The second line contains n distinct positive integersa1, a2, ..., an (1 ≤ ai ≤ 106) — elements of subsetA. 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 setA.
Sample Input
83 4 6 8 10 18 21 24
3
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.
3 ,6,18 存在整除的关系,个数为3个
#include<iostream>#include<cstring>#include<cstdio>#include<cstdlib>#include<algorithm>using namespace std;int dp[1000100];int n,m,x;int main(){ while(~scanf("%d",&n)){int Max=0;memset(dp,0,sizeof(dp));for(int i=0;i<n;i++){scanf("%d",&x);dp[x]++;for(int j=2;j*x<=1000001;j++){dp[j*x]=max(dp[j*x],dp[x]);}Max=max(Max,dp[x]);}printf("%d\n",Max);}}
- CodeForces 566F DP 查找所有整除关系的集合中元素的最大个数
- 查找集合中两个最大的元素
- python列表--查找集合中重复元素的个数
- 删除数组中所有能被3整除的元素
- 查找数组中最大的2个数
- 查找数组中最大的2个数
- CodeForces 55D 数位DP 能被它自身数位上的所有数整除
- 蓝桥杯--集合中元素的最大乘积
- Codeforces 55D Beautiful Numbers(数位dp,能被自己各个位上数字整除的数字个数)
- 第13周项目1删除数组中所有能被3整除的元素
- 删除数组中所有能被3整除的元素后输出数组
- 查找字符串中相同的最大字符和个数
- 查找n个数中最小的k个元素
- CodeForces 120F - 简单的树形DP
- 从一个集合中查找最大最小的N个元素——Python heapq 堆数据结构
- Lua两个table中B中所有元素大于等于A中每个元素的个数
- [leetcode 46] Permutations------数组中元素的所有排列组合集合
- 第十三周 项目1-1.4 1.5 输出数组中删掉所有能被3整除的元素 ,输出数组中插入后的所有元素
- PEP 8 -- Style Guide for Python Code 编程规范
- 关于spring加载xsd文件有关问题
- du 命令详解
- 通过分区(Partition)提升MySQL性能
- wpa_supplicant软件架构分析
- CodeForces 566F DP 查找所有整除关系的集合中元素的最大个数
- Number of Digit One
- 字符串插入
- linux c libcurl的简单使用
- Java SimpleDateFormat.setLenient(boolean lenient)方法使用
- ffmpeg 安装 libwave 解决 /usr/include/wavpack/wavpack.h:60: error: expected specifier-qualifier-list
- Memcached性能检测
- android接入支持海外的支付,visa,mastercard
- poj2376