Pagini recente » Cod sursa (job #2262996) | Cod sursa (job #248692) | Cod sursa (job #2161315) | Cod sursa (job #1919479) | Cod sursa (job #1711623)
#include <fstream>
using namespace std;
ifstream cin("transport.in");
ofstream cout("transport.out");
int n, v[16300];
int verif(int nr)
{
int drum=0,sc=0,i;
for(i=1; i<=n; i++)
{
sc+=v[i];
if(sc==nr)
{
sc=0;
drum++;
}
else if(sc>nr)
{
sc=v[i];
drum++;
}
}
if(sc!=0)
drum++;
return drum;
}
int main()
{
int k,i,max=-1,nr,pas;
cin>>n>>k;
for(i=1; i<=n; i++)
{
cin>>v[i];
if(v[i]>max)
max=v[i];
}
nr=max;
pas=1<<28;
while(pas!=0)
{
if(verif(nr+pas)>k)
nr+=pas;
pas/=2;
}
//while(verif(n,nr)>k)
// nr++;
cout<<nr+1;
cin.close();
cout.close();
return 0;
}