Pagini recente » Cod sursa (job #238952) | Cod sursa (job #2591529) | Cod sursa (job #1220289) | Cod sursa (job #2245498) | Cod sursa (job #1711606)
#include <fstream>
using namespace std;
ifstream cin("transport.in");
ofstream cout("transport.out");
int v[16300];
int verif(int n,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 n,k,i,max=-1,drumuri=-1,nr,sc;
cin>>n>>k;
for(i=1;i<=n;i++)
{
cin>>v[i];
if(v[i]>max)
max=v[i];
}
nr=max;
/*while(drumuri==-1||drumuri>k)
{
drumuri=0;
sc=0;
for(i=1;i<=n;i++)
{
sc+=v[i];
if(sc==nr)
{
sc=0;
drumuri++;
}
else if(sc>nr)
{
sc=v[i];
drumuri++;
}
}
if(sc!=0)
drumuri++;
nr++;
}*/
while(verif(n,nr)>k)
nr++;
cout<<nr;
cin.close();
cout.close();
return 0;
}