Pagini recente » Cod sursa (job #1302584) | Rating Daniel (DanielButum) | Cod sursa (job #2991273) | Cod sursa (job #436931) | Cod sursa (job #2945343)
#include<iostream>
#include<fstream>
using namespace std;
ifstream fin("transport.in");
ofstream fout("transport.out");
int n,k,v[16002];
bool se_poate(int c)
{
int cc = 0, nrt = 0;
for (int i = 1; i <= n; i++)
{
if (v[i] > cc)
{
nrt++;
cc = c;
}
if (nrt > k)
{
return false;
}
cc -= v[i];
}
return true;
}
/*int calc_drumuri(long long c)
{
int i,k=0;
long long copie=c;
for(i=1;i<=n;i++)
{
if(copie-v[i]>=0)
copie-=v[i];
else
{
k++;
copie=c;
copie-=v[i];
}
}
if(!k)
return 1;
return k;
}*/
int main()
{
int i,maxx=0;
long long st,dr,mij,mem;
fin>>n>>k;
for(i=1;i<=n;i++)
fin>>v[i];
for(i=1;i<=n;i++)
if(v[i]>maxx)
maxx=v[i];
st=maxx;
dr=256000000;
while(st<=dr)
{
mij=(st+dr)/2;
if(se_poate(mij))
{
mem=mij;
dr=mij-1;
}
else
{
st=mij+1;
}
}
fout<<mem;
fin.close();
fout.close();
return 0;
}