Pagini recente » Cod sursa (job #2589906) | Cod sursa (job #966953) | Cod sursa (job #877807) | Cod sursa (job #92141) | Cod sursa (job #3162780)
#include <iostream>
#include <fstream>
int v[16001];
int verif(int x,int n,int k)
{
int i=0,nr=0,cant=0;
for(i=1; i<=n; i++)
if(cant+v[i]<=x)
cant+=v[i];
else
if(v[i]>x)
return 0;
else
cant=v[i],nr++;
if(nr+1<=k) return 1;
return 0;
}
int main()
{
int rez,pas,n,k,i;
ifstream f("transport.in");
ofstream g("transport.out");
f>>n>>k;
for(i=1; i<=n; i++)
f>>v[i];
pas=1<<30;
rez=0;
while(pas)
{
if(!verif(rez+pas,n,k))
rez+=pas;
pas/=2;
}
g<<rez+1;
return 0;
}