Pagini recente » Cod sursa (job #2543370) | Cod sursa (job #1754501) | Cod sursa (job #405345) | Cod sursa (job #965201) | Cod sursa (job #2293088)
#include <iostream>
#include <fstream>
using namespace std;
int verificare(int numar,int N,int K,int v[])
{
int suma=0,i,counter=0;
for(i=1;i<=N;i++)
{
if(suma+v[i]<=numar)
{
suma=suma+v[i];
}
else
{
counter++;
suma=v[i];
}
}
if(counter>=K)
{
return 0;
}
else
{
return 1;
}
}
int main()
{
ifstream fin("transport.in");
ofstream fout("transport.out");
int N,K,st,dr,mijloc,i,v[16001],maxim=-1,suma=0;
fin>>N>>K;
for(i=1;i<=N;i++)
{
fin>>v[i];
suma=suma+v[i];
maxim=max(v[i],maxim);
}
st=maxim;
dr=suma;
while(st<=dr)
{
mijloc=st+(dr-st)/2;
if(verificare(mijloc,N,K,v)==1)
{
maxim=mijloc;
dr=mijloc-1;
}
else
{
st=mijloc+1;
}
}
fout<<maxim;
fin.close();
fout.close();
return 0;
}