Cod sursa(job #730721)
Utilizator | Data | 6 aprilie 2012 19:52:29 | |
---|---|---|---|
Problema | Transport | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.57 kb |
#include<fstream>
#include<iostream>
using namespace std;
int main()
{
ifstream fcin("transport.in");
ofstream fcout("transport.out");
int n,k,v[16001],st,dr=0,m,i,nr,asa,solutie;
fcin>>n>>k;
for(i=1;i<=n;i++)
{
fcin>>v[i];
if(st<v[i])
st=v[i];
dr+=v[i];
}
while(st<=dr)
{
nr=1;
asa=0;
m=(st+dr)/2;
for(i=1;i<=n;i++)
if(m<asa+v[i])
{
asa=v[i];
nr++;
}
else
asa+=v[i];
if(nr<=k)
{
solutie=m;
dr=m-1;
}
else
st=m+1;
cout<<st<<" "<<dr<<"\n";
}
fcout<<solutie;
return 0;
}