Pagini recente » Cod sursa (job #3253654) | Cod sursa (job #1600718) | Cod sursa (job #928291) | Cod sursa (job #3203637) | Cod sursa (job #2426953)
#include <iostream>
#include <fstream>
using namespace std;
const int NMAX=16000;
int n,v[NMAX],k;
ifstream in("transport.in");
ofstream out("transport.out");
bool se_poate(int c)
{
int cc=0,nrt=0;
for(int i=1; i<=n; i++)
{
if(v[i]>c)
{
return false;
}
if(v[i]>cc)
{
nrt++;
cc=c;
}
cc-=v[i];
}
return (nrt <= k);
}
int main()
{
int i,st,dr,m=0;
in>>n>>k;
st=1;
dr=NMAX*NMAX;
for(i=1; i<=n; i++)
{
in>>v[i];
}
int c=1;
while(st<dr)
{
m=(st+dr)/2;
if(se_poate(m))
{
dr=m;
}
else
{
st=m+1;
}
}
out<<st;
in.close();
out.close();
return 0;
}