Educational Codeforces Round 9 D. Longest Subsequence CF632D
来源:互联网 发布:通信网络优化工资 编辑:程序博客网 时间:2024/05/17 08:38
首先用数组记录一下每个数的数量
然后从大到小把i的倍数+上这个数的数量
这样数组就变成了记录某个数字的因子个数
#include <iostream>#include <algorithm>#include <sstream>#include <string>#include <queue>#include <cstdio>#include <map>#include <set>#include <utility>#include <stack>#include <cstring>#include <cmath>#include <vector>#include <ctime>#include <bitset>using namespace std;#define pb push_back#define sd(n) scanf("%d",&n)#define sdd(n,m) scanf("%d%d",&n,&m)#define sddd(n,m,k) scanf("%d%d%d",&n,&m,&k)#define sld(n) scanf("%lld",&n)#define sldd(n,m) scanf("%lld%lld",&n,&m)#define slddd(n,m,k) scanf("%lld%lld%lld",&n,&m,&k)#define sf(n) scanf("%lf",&n)#define sff(n,m) scanf("%lf%lf",&n,&m)#define sfff(n,m,k) scanf("%lf%lf%lf",&n,&m,&k)#define ss(str) scanf("%s",str)#define ans() printf("%d",ans)#define ansn() printf("%d\n",ans)#define anss() printf("%d ",ans)#define lans() printf("%lld",ans)#define lanss() printf("%lld ",ans)#define lansn() printf("%lld\n",ans)#define fansn() printf("%.10f\n",ans)#define r0(i,n) for(int i=0;i<(n);++i)#define r1(i,e) for(int i=1;i<=e;++i)#define rn(i,e) for(int i=e;i>=1;--i)#define rsz(i,v) for(int i=0;i<(int)v.size();++i)#define szz(x) ((int)x.size())#define mst(abc,bca) memset(abc,bca,sizeof abc)#define lowbit(a) (a&(-a))#define all(a) a.begin(),a.end()#define pii pair<int,int>#define pli pair<ll,int>#define pll pair<ll,ll>#define mp make_pair#define lrt rt<<1#define rrt rt<<1|1#define X first#define Y second#define PI (acos(-1.0))#define sqr(a) ((a)*(a))typedef long long ll;typedef unsigned long long ull;const ll mod = 1000000000+7;const double eps=1e-9;const int inf=0x3f3f3f3f;const ll infl = 10000000000000000;const int maxn= 2000000+10;const int maxm = 40000+10;//Pretests passedint in(int &ret){ char c; int sgn ; if(c=getchar(),c==EOF)return -1; while(c!='-'&&(c<'0'||c>'9'))c=getchar(); sgn = (c=='-')?-1:1; ret = (c=='-')?0:(c-'0'); while(c=getchar(),c>='0'&&c<='9')ret = ret*10+(c-'0'); ret *=sgn; return 1;}int cnt[maxn];int a[maxn];int main(){#ifdef LOCAL freopen("input.txt","r",stdin);// freopen("output.txt","w",stdout);#endif // LOCAL int n,m; sdd(n,m); r1(i,n) { int x; sd(x); a[i] = x; if(x>m)continue; ++cnt[x]; } for(int i = m;i;--i) { if(!cnt[i])continue; int x = cnt[i]; for(ll j = 1LL*i+i;j<=m;j+=i)cnt[j]+=x; } int ans = 0; int mx = 1; r1(i,m) { if(cnt[i]>ans) { ans = cnt[i]; mx = i; } } printf("%d %d\n",mx,ans); r1(i,n) { if(a[i]<=mx&&mx%a[i]==0)printf("%d ",i); } return 0;}
阅读全文
0 0
- Educational Codeforces Round 9 D. Longest Subsequence CF632D
- Educational Codeforces Round 9(D. Longest Subsequence(筛法))
- Educational Codeforces Round 9-D. Longest Subsequence(筛选法)
- (Educational Codeforces Round 9)Longest Subsequence(dp)
- Educational Codeforces Round 9 Longest Subsequence 思维+筛法
- Educational Codeforces Round 5 D Longest k-Good Segment 贪心
- Educational Codeforces Round 5 D. Longest k-Good Segment
- Educational Codeforces Round 5 (D. Longest k-Good Segment)
- Educational Codeforces Round 5 D. Longest k-Good Segment
- Educational Codeforces Round 5 D. Longest k-Good Segment
- CF632D:Longest Subsequence(思维 & 数论)
- Educational Codeforces Round 21-D
- Educational Codeforces Round 5 D
- Educational Codeforces Round 26 D
- Codeforces-632D Longest Subsequence
- Codeforces 632D Longest Subsequence
- Educational Codeforces Round 9
- Educational Codeforces Round 9
- 服务器安装mysql后配置远程访问权限
- setTimeout调用匿名函数
- matlab绘图窗口最大化命令
- 大二上转专业的规划以及别人的意见的记录
- 如何发表论文 怎么发表论文
- Educational Codeforces Round 9 D. Longest Subsequence CF632D
- 【QT】消息机制和事件
- 柯西-施瓦茨不等式的四种形式
- 关于unity的OnBecameVisible和OnBecameInvisible用法
- HTML小笔记《2017-10-14》
- display:none 与 opacity:0 与 visibility:hidden 三者的区别
- everything设置所有盘符自动更新,避免陌生路径下不能使用问题
- Java知识---类的多态
- 关于jinja2 宏定义的小问题