Pagini recente » Cod sursa (job #2904013) | Cod sursa (job #2870870) | Cod sursa (job #2476409) | Cod sursa (job #2903925) | Cod sursa (job #3174533)
#include <iostream>
#include <fstream>
using namespace std;
int v[16001];
int main()
{
ifstream cin("transport.in");
ofstream cout("transport.out");
int n,k,i,max=0,sum=0,st,dr,mij,sol,S,j;
cin>>n>>k;
for(i=1;i<=n;i++)
{
cin>>v[i];
sum+=v[i];
if(v[i]>max) max=v[i];
}
st=max;
dr=sum;
while(st<=dr)
{
mij=(st+dr)/2;
S=0;
j=0;
i=1;
while(i<=n)
{
S+=v[i];
if(S>k)
{
S=v[i];
j++;
}
i++;
}
if(S<=k && S!=v[i])
{
j++;
}
if(j>k)
{
st=mij+1;
}
else
{
dr=mij-1;
sol=j;
}
}
cout<<sol;
}