Pagini recente » Cod sursa (job #263270) | Cod sursa (job #3136632) | Cod sursa (job #2063681) | Cod sursa (job #2715138) | Cod sursa (job #1864903)
#include <fstream>
using namespace std;
ifstream fin("transport.in");
ofstream fout("transport.out");
int v[16002];
int main()
{
int n,k;
int st=0,dr=0,sol;
fin>>n>>k;
for(int i=1;i<=n;i++)
{
fin>>v[i];
if(v[i]>st) st=v[i];
dr+=v[i];
}
fout<<st<<' '<<dr<<' ';
while(st<=dr)
{
int mid=(st+dr)/2,nr=1,curent=0;
for(int i=1;i<=n;i++)
{
if(v[i]+curent>mid)
{nr++;curent=0;}
curent+=v[i];
}
if(nr<=k)
{
dr=mid-1;
sol=mid;
}
else
st=mid+1;
}
fout<<sol;
return 0;
}