E. Optimal Slots

https://codeforc.es/gym/102219/problem/E

总结：01背包路径记录；题意要按序列顺序输出路径~

#include<algorithm>
#include<set>
#include<cmath>
#include<cstring>
#include<iostream>
#include<set>
#include<vector>
#include<queue>
#include<cmath>
#include<cstdio>
#include<map>
#include<stack>
#include<bits/stdc++.h>
using namespace std;

#define sfi(i) scanf("%d",&i)
#define sfs(i) scanf("%s",(i))
#define pri(i) printf("%d\n",i)
#define sff(i) scanf("%lf",&i)
#define ll long long
#define ull unsigned long long
#define mem(x,y) memset(x,y,sizeof(x))
#define INF 0x3f3f3f3f
#define eps 1e-8
#define PI acos(-1)
#define lowbit(x) ((x)&(-x))
#define zero(x) (((x)>0?(x):-(x))<eps)
#define fl() printf("flag\n")
#define MOD(x) ((x%mod)+mod)%mod
#define endl '\n'
#define pb push_back
#define lson rt<<1,l,mid
#define rson rt<<1|1,mid+1,r
#define FAST_IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)

const int maxn=1e6+9;
const int mod=1e9+7;

inline ll read()
{
    ll f=1,x=0;
    char ss=getchar();
    while(ss<'0'||ss>'9')
    {
        if(ss=='-')f=-1;ss=getchar();
    }
    while(ss>='0'&&ss<='9')
    {
        x=x*10+ss-'0';ss=getchar();
    }    return f*x;
}

ll power(ll x,ll n)
{
    ll ans=1;
    while(n)
    {
        if(n&1) ans=ans*x;
        x=x*x;
        n>>=1;
    }
    return ans;
}

int dp[1009],p[1009][1009];
int a[maxn];
int n,t;
void solve1(int i,int j)
{
    while(i<=n&&j)
    {
        if(dp[j]==dp[j-a[i]]+a[i])
        {
            cout<<a[i]<<" ";
            j-=a[i];
        }
        i++;
    }
}


void solve2(int i,int j)
{
    while(j&&i<=n)
    {
        if(p[i][j]>0)
        {
            cout<<a[i]<<" ";
            j-=a[i];
        }
        i++;
    }
}
int main()
{
    //FAST_IO;


    while(cin>>t&&t)
    {
        cin>>n;
        mem(dp,0);
        mem(p,0);
        for(int i=1;i<=n;i++) cin>>a[i];

        for(int i=n;i>=1;i--)
        {
            for(int j=t;j>=a[i];j--)
            {
                if(dp[j]<=dp[j-a[i]]+a[i])
                {
                    dp[j]=dp[j-a[i]]+a[i];
                    p[i][j]=1;
                }

            }
        }
        solve2(1,t);
        cout<<dp[t]<<endl;


    }

    return 0;
}