Codeforces 837D - Round Subset DP

先算出每个数的pop1(twonum),pop(fivenum)然后DP ans[i][j]表示选i个数有j个2时最多有多少个5

转移方程是

        for(int j=k;j>=;j--)
        {
        for(int w=pop1;w<;w++)
        {
        ans[j][w]=max(ans[j][w],ans[j-][w-pop1]+pop);
        }
        }

AC程序:

#include <bits/stdc++.h>
#include <cstring>
#include <iostream>
#include <algorithm>
#include<queue>
#define EPS 1.0e-9
#define PI acos(-1.0)
#define INF 30000000
#define MOD 1000000007
#define mem(a,b) memset((a),b,sizeof(a))
#define TS printf("!!!\n")
#define pb push_back
#define pai pair<int,int>
//using ll = long long;
//using ull= unsigned long long;
//std::ios::sync_with_stdio(false);
using namespace std;
//priority_queue<int,vector<int>,greater<int>> que;
typedef long long ll;
typedef unsigned long long ull;
const int maxn=;
struct num
{
  int two;
  int five;
}number[];
ll ans[][];
int main()
{
        mem(ans,-);
        ans[][]=;
    int n;
    int k;
    cin >> n >> k;
    int now;
    int pop,pop1;
    num temp;
    for(int i=;i<=n;i++)
        {
        pop=pop1=;
        cin >> now;
        while(now&&now%==)
        {
        pop++;
        now/=;
        }
        while(now&&now%==)
        {
        pop1++;
        now/=;
        }
        for(int j=k;j>=;j--)
        {
        for(int w=pop1;w<;w++)
        {
        ans[j][w]=max(ans[j][w],ans[j-][w-pop1]+pop);
        }
        }
        }
        ll anser=;
        for(ll i=;i<=;i++)
        anser=max(anser,min(i,ans[k][i]));
        cout<<anser<<endl;
    return ;
}