Pagini recente » Cod sursa (job #2582673) | Cod sursa (job #3004663) | Cod sursa (job #327298) | Cod sursa (job #2604699) | Cod sursa (job #1706916)
#include <iostream>
#include <fstream>
using namespace std;
ifstream in ("transport.in");
ofstream out("transport.out");
const int N=16005;
int n,k,v[N],nmax,sum;
bool sepoate(int t)
{
int i, c=t,nr=1;
for(int i=1;i<=n;i++)
{
if(v[i]>c)
{
c=t;
nr++;
}
if(v[i]>c) return false;
if(nr>k) return false;
c-=v[i];
}
return true;
}
int cb()
{
int i=0,pas=1 << 30;
while(pas!=0)
{
if(!sepoate(i+pas))
{
i+=pas;
}
pas/=2;
}
return 1+i;
}
int main()
{
int i;
in>>n>>k;
for(i=1; i<=n; i++)
{
in>>v[i];
if(nmax<v[i])
nmax=v[i];
}
out<<cb();
return 0;
}