Pagini recente » Cod sursa (job #815739) | Cod sursa (job #1249216) | Cod sursa (job #334343) | Cod sursa (job #745595) | Cod sursa (job #2074115)
#include <fstream>
using namespace std;
ifstream in ("transport.in");
ofstream out ("transport.out");
const int N=16002;
int v[N],n,k;
int verif(int l)
{
int i,s=0,cnt=1;
for (i=1;i<=n;i++)
{
s+=v[i];
if (l<s+v[i+1])
cnt++, s=0;
}
if (cnt>k)
return 0;
return 1;
}
int main()
{
int i,r=0,pas=1<<30;
in>>n>>k;
for (i=1;i<=n;i++)
in>>v[i];
while (pas)
{
if (verif(r+pas)==0)
r+=pas;
pas/=2;
}
out<<r+1;
return 0;
}