Cod sursa(job #2472377)

Utilizator Tudor2PopescuPopescu Tudor-Cristian Tudor2Popescu Data 12 octombrie 2019 12:00:15
Problema Problema rucsacului Scor 0
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.4 kb
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
long V1[100],pV[100],V2[100],D[100][100];
int w[100],p[100];
int n,g;
int rucsac1()
{
    int i,j,a,b;
    for(i=1;i<=n;i++)
    {
        for(j=0;j<=g;j++)
        {
            if(j<w[i]) V1[j]=pV[j];
            else
            {
                a=pV[j];
                b=pV[j-w[i]]+p[i];
                V1[j]=max(a,b);
            }
        }
        for(j=0;j<=g;j++)
        {
            pV[j]=V1[j];
        }
    }
    return V1[g];
}
int rucsac2()
{
    int i,j;
    for(i=1;i<=n;i++)
    {
        for(j=g;j>=w[i];j--)
        {
            V2[j]=max(V2[j],V2[j-w[i]]+p[i]);
        }
    }
    return V2[g];
}
int rucsac3()
{
    int i,j;
    for(i=0;i<n;i++)
    {
        for(j=0;j<=g;j++)
        {
            if(j<w[i+1])
            {
                D[i+1][j]=D[i][j];
            }
            else
            {
                D[i+1][j]=max(D[i][j],D[i][j-w[i+1]]+p[i+1]);
            }
        }
    }
    return D[n][g];
}
int main()
{
    int i;
    fin>>n>>g;
    for(i=1;i<=n;i++)
    {
        fin>>w[i]>>p[i];
    }
    for(i=0;i<=n;i++)
    {
        for(int j=0;j<=g;j++)
        {
            fout<<D[i][j]<<" ";
        }
        fout<<"\n";
    }
    fin.close();
    fout.close();
    return 0;
}