Pagini recente » Cod sursa (job #2141858) | Cod sursa (job #3289418) | Cod sursa (job #3154469) | Cod sursa (job #2454083) | Cod sursa (job #1670874)
#include <fstream>
/*#INCLUDE <VALOARE>
#INCLUDE <BO$$>
#INCLUDE <NOT_BUREA>
#INCLUDE <BIBLIA>
#INCLUDE <DUMNIZO>
#INCLUDE <HAI_CU_100>
#INCLUDE <DESTROY_CIOCIEA_CEL_CIOCIT_DE_CIOACA_CIOCISMULUI_DE_CIOCI>*/
using namespace std;
ifstream in("transport.in");
ofstream out("transport.out");
int k,n,v[16001];
bool transport(int m)
{
int i=1,t,ti,nr;
ti=m;t=ti;nr=k;
while(i<=n&&nr>0)
{
if(v[i]<=t)
{t-=v[i];i++;}
else
{nr--;t=ti;}
}
if(i>n) return 1;
else return 0;
}
int cautbin(int s,int d)
{
int m;
while(s<=d)
{
m=s+(d-s)/2;
if(transport(m)==1)
{
if(m==s) return m;
else {
if(transport(m-1)==0) return m;
else d=m-1;
}
}
else s=m+1;
}
}
int main()
{
int i,r,ma=0;
long long sum=0;
in>>n>>k;
for(i=1; i<=n; i++)
{
in>>v[i];
sum+=v[i];
if(v[i]>ma) ma=v[i];
}
r=cautbin(ma,sum);
out<<r;
return 0;
}