Pagini recente » Cod sursa (job #182132) | Cod sursa (job #51508) | Cod sursa (job #582852) | Cod sursa (job #1780598) | Cod sursa (job #1446214)
#include <fstream>
#include <string.h>
#define dim 101
using namespace std;
ifstream fin("lapte.in");
ofstream fout("lapte.out");
int bst[dim][dim*dim],rep[dim][dim*dim],lim,lim2,st,dr,mijl,sol,poz,n,l,i;
struct cub
{
int a;
int b;
}v[dim];
int verif(int timp)
{
lim=lim2=0;
for(int i=1;i<=n;i++)
{
lim+=timp/v[i].a;
for(int j=0;j<=lim;j++)
for(int k=max(0,lim2-lim+j);k<=j&&k<=lim2;k++)
{
int x=bst[i-1][k]+(timp-(j-k)*v[i].a)/v[i].b;
if(x>=bst[i][j])
{
bst[i][j]=x;
rep[i][j]=k;
}
}
lim2=lim;
}
for(int i=l;i<=lim;i++)
if(bst[n][i]>=bst[n][poz])
poz=i;
if(bst[n][poz]>=l)
return 1;
return 0;
}
void drum(int i, int j)
{
if(i>0)
{
int k=rep[i][j];
drum(i-1,k);
fout<<j-k<<" "<<bst[i][j]-bst[i-1][k]<<'\n';
}
}
int main()
{
fin>>n>>l;
for(i=1;i<=n;i++)
fin>>v[i].a>>v[i].b;
st=1,dr=100;
while(st<=dr)
{
poz=l;
mijl=(st+dr)/2;
if(verif(mijl))
{
sol=mijl;
dr=mijl-1;
}
else
st=mijl+1;
memset(bst,0,sizeof(bst));
}
verif(sol);
fout<<sol<<'\n';
drum(n,poz);
return 0;
}