解题思路:
注意事项:
参考代码:
#include<iostream> #include<algorithm> #include<cmath> #include<vector> #define F(i,j,k) for(int i = j; i < k; ++i) #define ed <<endl #define kg <<' '<< #define ct cout<< #define tmp (t+(i-1)*p) using namespace std; int m,k,maxx,p,ans,a[100005]; int solve(int t){ int dp[100005]; dp[0] = 0; dp[1] = a[t]; int i; for(i=2;tmp <= maxx; ++i){ dp[i] = max(dp[i-1],dp[i-2] + a[tmp]); } return dp[i-1]; } int main(){ cin>>m>>p; F(i,0,m){ cin>>k; a[k] ++; maxx = maxx> k? maxx : k; }//ct maxx ed; if(p==0){ F(i,0,maxx+1){ if(a[i])ans++; } ct ans; exit(0); } F(i,0,p){ ans += solve(i); } ct ans; }
0.0分
2 人评分