Pagini recente » Cod sursa (job #466028) | Cod sursa (job #53383) | Cod sursa (job #1685695) | Cod sursa (job #1685694)
#include <fstream>
using namespace std;
ifstream in("transport.in");
ofstream out("transport.out");
int v[160001];
int main()
{
int n,i,c=0,s,k,zile,cnt,stot=0,strue=0,ok=0,max=0;
in>>n>>k;
for(i=1; i<=n; i++)
{
in>>v[i];
strue+=v[i];
if(max<=v[i])
max=v[i];
}
c=max;
while(true)
{
ok=0;
stot=0;
c++;
for(i=1,cnt=0; i<=n; cnt++)
{
s=0;
while(s<=c)
{
if(s+v[i]<=c&&i<=n)
{
s+=v[i];
i++;
}
else
break;
}
stot+=s;
}
if(stot==strue&&cnt<=k)
{
out<<c;
break;
}
}
return 0;
}