CodeForces 632D Longest Subsequence(数论)
来源:互联网 发布:mac开机后鼠标不能动 编辑:程序博客网 时间:2024/05/17 22:20
题意:求一个最长子序列使得序列中的数的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;}
0 0
- CodeForces 632D Longest Subsequence(数论)
- Codeforces-632D Longest Subsequence
- Codeforces 632D Longest Subsequence
- Longest Subsequence codeforces 632D 暴力数学
- [杂题] Codeforces #632D Longest Subsequence
- Longest Subsequence CodeForces 632D 数学/筛法
- Codeforces 632D Longest Subsequence 【求因子和变形】
- Educational Codeforces Round 9(D. Longest Subsequence(筛法))
- CF632D:Longest Subsequence(思维 & 数论)
- Educational Codeforces Round 9-D. Longest Subsequence(筛选法)
- Educational Codeforces Round 9 D. Longest Subsequence CF632D
- CF 632D(Longest Subsequence-计数排序)
- D. Longest Subsequence
- codeforces Longest Increasing Subsequence
- codeForces-Longest Subsequence
- Longest Subsequence CodeForces
- cf#ecr9-D - Longest Subsequence
- CodeForces 615 D. Multipliers(数论)
- iOS高端面试题
- 2005年浙江大学计算机及软件工程研究生机试真题
- 第四周,项目5,递归求值(4)
- Objective-C Runtime
- jQuery.extend和jQuery.fn.extend的区别
- CodeForces 632D Longest Subsequence(数论)
- 第5周项目1-三角形类雏形(4)
- Spring学习——(六)Spring与Hibernate整合
- 什么是多路复用
- scrollView实践经验
- 太乐了
- GFS MapReduce BigTable关系
- POJ 3253 Fence Repair
- Linux tcpdump命令详解[转]