Cod sursa(job #1830275)
Utilizator | Data | 16 decembrie 2016 15:05:24 | |
---|---|---|---|
Problema | Transport | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.72 kb |
#include <fstream>
using namespace std;
ifstream fin("transport.in");
ofstream fout("transport.out");
int n,k,v[16001],st,i,s,dr,Max,mid,sum,nr,sol;
int main()
{
fin>>n>>k;
for(i=1;i<=n;i++){
fin>>v[i];
s=s+v[i];
if(v[i]>Max)
Max=v[i];
}
st=Max;
dr=s;
while(st<=dr){
mid=(st+dr)/2;
sum=0;
nr=1;
for(i=1;i<=n;i++){
if(sum+v[i]<=mid)
sum=sum+v[i];
else{
nr++;
sum=v[i];
}
}
if(nr<=k){
sol=mid;
dr=mid-1;
}
else
st=mid+1;
}
fout<<sol;
return 0;
}