Cod sursa(job #730715)
| Utilizator | Data | 6 aprilie 2012 19:38:10 | |
|---|---|---|---|
| Problema | Transport | Scor | 20 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.5 kb |
#include<fstream>
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=0;
m=(st+dr)/2;
for(i=1;i<=n;i++)
{
for(asa=0;asa<=m;i++)
asa+=v[i];
nr++;
i--;
}
if(nr<=k)
{
solutie=m;
dr=m-1;
}
else
st=m+1;
}
fcout<<solutie;
return 0;
}
