Cod sursa(job #1483426)
Utilizator | Data | 9 septembrie 2015 11:40:37 | |
---|---|---|---|
Problema | Transport | Scor | 40 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.65 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("transport.in");
ofstream g("transport.out");
int n,k,i,v[16001],st,dr,s,capa,m,x;
int main()
{
f>>n>>k;
for(i=1;i<=n;i++)
{
f>>v[i];
dr=dr+v[i];
if(v[i]>st)
st=v[i];
}
dr++;
while(st<=dr)
{
m=(st+dr)/2;
x=0;
for(i=0;i<=n;){
x++;s=0;
while(s+v[i+1]<=m)
s=s+v[++i];
}
if(x<=k)
{
capa=m;
dr=m-1;
}
else
{
st++;
}
}
g<<capa;
return 0;
}