zoukankan      html  css  js  c++  java
  • Educational Codeforces Round 9 D. Longest Subsequence dp

    D. Longest Subsequence

    题目连接:

    http://www.codeforces.com/contest/632/problem/D

    Description

    You are given array a with n elements and the number m. Consider some subsequence of a and the value of least common multiple (LCM) of its elements. Denote LCM as l. Find any longest subsequence of a with the value l ≤ m.

    A subsequence of a is an array we can get by erasing some elements of a. It is allowed to erase zero or all elements.

    The LCM of an empty array equals 1.

    Input

    The first line contains two integers n and m (1 ≤ n, m ≤ 106) — the size of the array a and the parameter from the problem statement.

    The second line contains n integers ai (1 ≤ ai ≤ 109) — the elements of a.

    Output

    In the first line print two integers l and kmax (1 ≤ l ≤ m, 0 ≤ kmax ≤ n) — the value of LCM and the number of elements in optimal subsequence.

    In the second line print kmax integers — the positions of the elements from the optimal subsequence in the ascending order.

    Note that you can find and print any subsequence with the maximum length.

    Sample Input

    7 8
    6 2 9 2 7 2 3

    Sample Output

    6 5
    1 2 4 6 7

    Hint

    题意

    给n个数,然后你要找到一个最长的序列,使得序列中的数的lcm小于m

    题解:

    lcm和顺序无关,所以我们只要统计每个数有多少个就好了

    然后再类似筛法一样,去筛每一个数的因子有多少个就好了。

    代码

    #include<bits/stdc++.h>
    using namespace std;
    const int maxn = 1e6+5;
    int cnt[maxn];
    int dp[maxn];
    int a[maxn];
    int main()
    {
        int n,m;
        scanf("%d%d",&n,&m);
        for(int i=1;i<=n;i++)
        {
            scanf("%d",&a[i]);
            if(a[i]<=m)cnt[a[i]]++;
        }
        for(int i=m;i;i--)
            for(int j=i;j<=m;j+=i)
                dp[j]+=cnt[i];
        long long ans1=-1,ans2=-1;
        for(int i=1;i<=m;i++)
            if(dp[i]>ans1)
                ans1=dp[i],ans2=i;
        cout<<ans2<<" "<<ans1<<endl;
        for(int i=1;i<=n;i++)
            if(ans2%a[i]==0)
                cout<<i<<" ";
        cout<<endl;
    
    }
  • 相关阅读:
    知识点
    nodejs总结之redis模块
    nodejs总结之日志模块log4js
    各种类型的串口说明
    linux常用命令
    JAVA总结之编码
    JAVA总结之异常
    JAVA总结之方法重载
    JAVA总结之关键字static和final
    JAVA总结之数组篇
  • 原文地址:https://www.cnblogs.com/qscqesze/p/5236807.html
Copyright © 2011-2022 走看看