Cod sursa(job #1677416)
Utilizator | Data | 6 aprilie 2016 15:57:52 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include<bits/stdc++.h>
using namespace std;
int N, M, Pmax;//M-masa N -Nr de
bool u;
int G[5000], P[5000];//G Greutate
int D[2][1000 ];
int main()
{
for(int i = 1; i <= N; ++i){
for(int m = 0; m <= M; ++m){
D[u][m] = D[!u][m];
if(G[i] <= m)
D[u][m] = max(D[u][m], D[!u][m - G[i]] + P[i]);
}
u = !u;
}
u = !u;
Pmax = D[u][M];
cout << Pmax;
return 0;
}