[杂题] Codeforces #632D Longest Subsequence
来源:互联网 发布:51talk软件下载 编辑:程序博客网 时间:2024/05/18 07:01
值的范围是
实际上这题有一个条件弱化的思想,不需要一定是最小公倍数,大的公倍数满足,对应的最小公倍数也满足。
#include<cstdio>#include<algorithm>using namespace std;const int maxn=1000005;int n,m,a[maxn],cnt[maxn],f[maxn],_max=0,k=1;int main(){ freopen("cf632D.in","r",stdin); freopen("cf632D.out","w",stdout); 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=1;i<=m;i++) for(int j=i;j<=m;j+=i) f[j]+=cnt[i]; for(int i=1;i<=m;i++) if(_max<f[i]) _max=f[i], k=i; printf("%d %d\n",k,_max); for(int i=1;i<=n;i++) if(k%a[i]==0) printf("%d ",i); return 0;}
阅读全文
0 0
- [杂题] Codeforces #632D Longest Subsequence
- Codeforces-632D Longest Subsequence
- Codeforces 632D Longest Subsequence
- CodeForces 632D Longest Subsequence(数论)
- Longest Subsequence codeforces 632D 暴力数学
- Longest Subsequence CodeForces 632D 数学/筛法
- Codeforces 632D Longest Subsequence 【求因子和变形】
- Educational Codeforces Round 9(D. 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
- 【29.41%】【codeforces 724D】Dense Subsequence
- 【Codeforces 724D】 Dense Subsequence【贪心】
- Django-rest-framework中过滤器的定制
- BZOJ 1598: [Usaco2008 Mar]牛跑步 启发式搜索
- 函数/代码的安全与volatile
- Android Studio代码调试大全
- erlang 服务器崩溃bug
- [杂题] Codeforces #632D Longest Subsequence
- java学习系列4(内存模型)
- 27. Remove Element
- eclipse启动出现“An Error has Occurred. See the log file”解决方法
- 1.电子商务支付方式有哪些 2.比较不同支付方式的优势劣势
- SVN学习笔记
- ELK【1】
- 关于jdk1.8+jmter3.3安装配置问题小结
- TensorFlow安装与配置