Pagini recente » Cod sursa (job #1896763) | Cod sursa (job #2999861) | Cod sursa (job #1639971) | Cod sursa (job #1257380) | Cod sursa (job #827084)
Cod sursa(job #827084)
#include <fstream>
#include <string.h>
#include <vector>
#include <map>
#define MAX_N ((const unsigned int)20000)
#define MAX_G ((const unsigned int)75000)
#define INFINITE ((const unsigned int)-1000000)
typedef std::vector<int> Vector;
typedef std::map<int, Vector> Index;
int N, G;
int w[MAX_N];
unsigned int min[MAX_G];
Index sol;
Vector solFin;
unsigned int nr = INFINITE;
unsigned int weight = 0;
int main()
{
std::ifstream fin("ghiozdan.in");
std::ofstream fout("ghiozdan.out");
fin>>N>>G;
for (int i = 0; i < N; ++ i)
fin>>w[i];
memset(min, INFINITE, sizeof(int) * MAX_G);
min[0] = 0;
for (int i = 0; i < N; ++ i)
{
for (int j = G - w[i]; j >= 0; -- j)
{
if (min[j + w[i]] > min[j] + 1)
{
min[j + w[i]] = min[j] + 1;
if (j + w[i] >= weight)
{
sol[min[j + w[i]]] = sol[min[j]];
sol[min[j + w[i]]].push_back(i);
if (weight != j + w[i])
weight = j + w[i];
if (nr != min[j + w[i]])
{
nr = min[j + w[i]];
}
}
}
}
}
fout<<weight<<" "<<nr<<'\n';
for (int i = 0; i < sol[nr].size(); ++ i)
fout<<sol[nr][i]<<'\n';
fin.close();
fout.close();
return 0;
}