codeforces 837D Round Subset (dp)

解题思路：题目有很明显的dp特征（涉及多种状态和状态之间的关系）。

我们考虑状态的定义，很容易知道尾0的个数取决于因子2和5中次数较小的一个。

设状态 dp[i][j][k] 表示前i个数中选取j个并且这j个数的乘积包含的5的幂次为k的情况下 乘积包含2的最大幂次

最后的答案就是遍历第三维的取值，找到2和5最小值最大的情况。

需要注意的是，如果直接开成这样的三维数组可能会MLE，所以我们可以采用滚动数组的优化，或者将第一维压缩。

AC代码：

/*
* @Author: wchhlbt
* @Last Modified time: 2017-09-30
*/
//#include <bits/stdc++.h>
#include <vector>
#include <list>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <cstring>
#include <limits>
#include <climits>
#include <cstdio>

#define inf 0x3f3f3f3f
#define pb push_back
#define AA first
#define BB second
#define ONES(x) __builtin_popcount(x)
#define _  << "  " <<
using namespace std;

typedef pair<int, int> P;
typedef long long ll ;
int dx[4] = {0,0,1,-1};
int dy[4] = {1,-1,0,0};
const double eps =1e-8;
const int mod = 1000000007;
const double PI = acos(-1.0);
inline int read(){ int num;    scanf("%d",&num);   return num;}
const int maxn = 1007;

int dp[2][207][6007];
int two[207];
int five[207];

void solve(int i, ll num)
{
	while(num!=0 && num%5==0){
		five[i]++;
		num /= 5;
	}
	while(num!=0 && num%2==0){
		two[i]++;
		num /= 2;
	}
}
int main()
{
	int n = read(); int k = read();
	for(int i = 1; i<=n; i++){
		ll num;
		cin>>num;
		solve(i,num);
	}
	memset(dp,-1,sizeof dp);
	dp[0][0][0] = 0;
	for(int i = 1; i<=n; i++){
		int o = i&1;
		for(int j = 0; j<=i; j++){
			for(int k = 0; k<6000; k++){
				dp[o][j][k] = dp[1-o][j][k];
				if(k>=five[i] && ~dp[1-o][j-1][k-five[i]] && j>=1)
					dp[o][j][k] = max ( dp[o][j][k], dp[1-o][j-1][k-five[i]]+two[i]);
			}
		}
	}
	int o = n&1;
	int ans = 0;
	for(int i = 0; i<6000; i++){
		ans = max( min(dp[o][k][i],i) , ans);
	}
	cout << ans << endl;
    return 0;
}

压缩为二维

/*
* @Author: wchhlbt
* @Last Modified time: 2017-09-30
*/
//#include <bits/stdc++.h>
#include <vector>
#include <list>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <cstring>
#include <limits>
#include <climits>
#include <cstdio>

#define inf 0x3f3f3f3f
#define pb push_back
#define AA first
#define BB second
#define ONES(x) __builtin_popcount(x)
#define _  << "  " <<
using namespace std;

typedef pair<int, int> P;
typedef long long ll ;
int dx[4] = {0,0,1,-1};
int dy[4] = {1,-1,0,0};
const double eps =1e-8;
const int mod = 1000000007;
const double PI = acos(-1.0);
inline int read(){ int num;    scanf("%d",&num);   return num;}
const int maxn = 1007;

int dp[207][6007];
int two[207];
int five[207];

void solve(int i, ll num)
{
	while(num!=0 && num%5==0){
		five[i]++;
		num /= 5;
	}
	while(num!=0 && num%2==0){
		two[i]++;
		num /= 2;
	}
}
int main()
{
	int n = read(); int k = read();
	for(int i = 1; i<=n; i++){
		ll num;
		cin>>num;
		solve(i,num);
	}
	memset(dp,-1,sizeof dp);
	dp[0][0] = 0;
	for(int i = 1; i<=n; i++){
		for(int j = i; j>=0; j--){// j和k都应该逆序循环
			for(int k = 6000; k>=0; k--){
				if(k>=five[i] && ~dp[j-1][k-five[i]] && j>=1)
					dp[j][k] = max ( dp[j][k], dp[j-1][k-five[i]]+two[i]);
			}
		}
	}
	int ans = 0;
	for(int i = 0; i<=6000; i++){
		ans = max( min(dp[k][i],i) , ans);
	}
	cout << ans << endl;
    return 0;
}