VK Cup 2015 - Finals F. Clique in the Divisibility Graph
来源:互联网 发布:货运通软件下载 编辑:程序博客网 时间:2024/04/28 12:56
题目链接
题意:给你n个数,求一个最长子序列,要求是这个子序列中任意两个数,其中一个一定是另外一个的倍数
代码如下:
#include <stdio.h>#include <string.h>#include <iostream>#include <algorithm>const int N = 1E6+10;using namespace std;int dp[N], a;int main(){ int n, maxn; while(~scanf("%d", &n)) { memset(dp, 0, sizeof(dp)); maxn = 0; for(int i = 0; i < n; i++) { scanf("%d", &a); dp[a]++; maxn = max(maxn, dp[a]); for(int j = a * 2; j <= N; j += a) dp[j] = max(dp[j], dp[a]); } printf("%d\n", maxn); }}
0 0
- VK Cup 2015 - Finals F. Clique in the Divisibility Graph
- VK Cup 2015 - Finals, online mirror F. Clique in the Divisibility Graph 数论
- VK Cup 2015 - Finals, online mirror F - Clique in the Divisibility Graph dp
- codeforces 566F F. Clique in the Divisibility Graph(dp)
- 【CF 566F】 Clique in the Divisibility Graph
- Codeforces 566 F. Clique in the Divisibility Graph
- codeforces 566F. Clique in the Divisibility Graph dp
- Clique in the Divisibility Graph
- 周赛-Clique in the Divisibility Graph
- [CodeForces 566F] Clique in the Divisibility Graph (记忆化搜索)
- CF Clique in the Divisibility Graph (DP)
- VK Cup 2015 - Finals, online mirror
- Clique in the Divisibility Graph(dp递推的应用) (上升子序列)
- VK Cup 2012 Finals E
- Codeforces Round #424 (Div. 2, rated, based on VK Cup Finals) F. Bamboo Partition
- VK Cup 2015 - Finals, online mirror D. Restructuring Company 并查集 stl应用
- Matching Names(Trie树)-(VK Cup 2015 - Finals, online mirror)
- VK Cup 2015 - Finals, online mirror D. Restructuring Company 并查集 set 二分
- 编程之美:第二章 数字之魅 2.10寻找数组中的最大值和最小值
- uva5318 The Goddess Of The Moon dp+矩阵快速幂
- 面试题42反转单词顺序VS左旋字符串(循环左移字符串)
- ural 1019
- JavaScript笔记
- VK Cup 2015 - Finals F. Clique in the Divisibility Graph
- 占座……
- scp 远程复制到本地
- 【转】MySQL修改字段默认值_mysql数据库_三联
- C++运算符重载总结
- 递归的归并排序
- 淘宝 NPM 镜像
- 编程之美: 第二章 数字之魅 2.11寻找最近点对
- phonegap+ionic学习(一)--搭建开发环境