Pagini recente » Cod sursa (job #1205058) | Cod sursa (job #1463966) | Cod sursa (job #2479540) | Cod sursa (job #2376642) | Cod sursa (job #1060409)
#include <fstream>
using namespace std;
const int N=16001;
ifstream fin("transport.in");
ofstream fout("transport.out");
int a[N];
int n, k;
bool verif(int x)
{
int i, s=0, sol=0;
for(i=1;i<=n;i++)
{
if(s<a[i])
{
s=x-a[i];
sol++;
}
else
{
s-=a[i];
}
}
if(sol<=k) return 1;
return 0;
}
int main()
{
int i, st=1, dr=0, mid, sol;
fin>>n>>k;
for(i=1;i<=n;i++)
{
fin>>a[i];
dr+=a[i];
}
while(st<=dr)
{
mid=(st+dr)/2;
if(verif(mid))
{
sol=mid;
dr=mid-1;
}
else
{
st=mid+1;
}
}
fout<<sol;
}