VK Cup 2015 - Finals, online mirror F - Clique in the Divisibility Graph dp

题意：n个数中选出一些序列，使得序列中任意两个数x，y，x整除y或者y整除x。

设dp【i】表示值为i时序列中的最长长度，就可以从i的约数中转移过来了

#include <bits/stdc++.h>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <cmath>
#include <time.h>
#include <vector>
#include <cstdio>
#include <string>
#include <iomanip>
///cout << fixed << setprecision(13) << (double) x << endl;
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <algorithm>

using namespace std;

#define lson l, mid, rt << 1
#define rson mid + 1, r, rt << 1 | 1
#define ls rt << 1
#define rs rt << 1 | 1
#define pi acos(-1.0)
#define eps 1e-8
#define Mp(a, b) make_pair(a, b)
#define asd puts("asdasdasdasdasdf");
typedef long long ll;
//typedef __int64 LL;
const int inf = 0x3f3f3f3f;
const int N = 1000010;

int dp[N];

int main()
{
	int n;
	while( ~scanf("%d", &n) ) {
		int ans = 0;
		memset( dp, 0, sizeof( dp ) );
		for( int i = 1, x; i <= n; ++i ) {
			scanf("%d", &x);
			dp[x]++;
			ans = max( ans, dp[x] );
			for( int j = x*2; j <= N-5; j += x )
				dp[j] = max( dp[j], dp[x] );
		}
		printf("%d\n", ans);
	}
	return 0;
}