Dynamic.Programming/dp-17(bestsum tabulation).cpp at main · Shuvro-d/Dynamic.Programming · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
#include<bits/stdc++.h>
#define        ll     long long int
using namespace std;
int main()
{
    int n,m;
    cin>>n>>m;
    int a[m];
    for(int i=0; i<m; i++)cin>>a[i];
    vector<vector<int> >v;

    for(int i=0; i<=n; i++)
    {
        vector<int>x;
        x.push_back(0);
        v.push_back(x);
    }
    v[0].pop_back();
    v[0].push_back(1);

    for(int i=0; i<n; i++)
    {
        if(v[i][0]>0)
        {
            for(int j=0; j<m; j++)
            {
                int x=i+a[j];
                if(x<=n)
                {
                    if(v[x][0]==0)
                    {
                        v[x].pop_back();
                        if(i>0)v[x]=v[i];
                        v[x].push_back(a[j]);
                    }
                    else
                    {
                        vector<int>sos;
                        if(i>0)sos=v[i];
                        sos.push_back(a[j]);
                        if(sos.size()<v[x].size()){
                            v[x]=sos;
                        }
                    }
                }
            }
        }
    }
    for(int i=0; i<v[n].size(); i++)cout<<v[n][i]<<" ";
    cout<<endl;
    return 0;
}