Pagini recente » Cod sursa (job #3038713) | Cod sursa (job #3155067) | Cod sursa (job #1012689) | Cod sursa (job #1610717) | Cod sursa (job #1707088)
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("transport.in");
ofstream out("transport.out");
const int DIM=17000;
int saltea[DIM],sum[DIM];
int pas=30,t,n;
bool sePoate(int);
int cb();
int main()
{
int i,j,mini=100000001,nrp;
bool bn=0;
in >> n >> t;
for(i=1; i<=n; ++i)
{
in >> saltea[i];
sum[i]=saltea[i]+sum[i-1];
}
out << cb();
return 0;
}
bool sePoate(int k)
{
int i,c=k,nr=1;
for(i=1; i<=n; ++i)
{
if(saltea[i]>c)
{
c=k;
nr++;
}
if(saltea[i]>c) return false;
if(nr>t) return false;
c-=saltea[i];
}
return true;
}
int cb()
{
int i=1,pas=1<<30;
while(pas)
{
if(!sePoate(i+pas))
i+=pas;
pas/=2;
}
return i+1;
}