Cod sursa(job #1994897)
| Utilizator | Data | 26 iunie 2017 15:25:25 | |
|---|---|---|---|
| Problema | Transport | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.87 kb |
#include <fstream>
#define MAX 16002
using namespace std;
ifstream fin("transport.in");
ofstream fout("transport.out");
int n,k,v[MAX],cmax;
int main()
{
fin >> n >> k;
int lo=1,hi=MAX*MAX;
for (int i=1;i<=n;i++)
{
fin >> v[i];
if (v[i]>lo)
lo=v[i];
}
int mi=lo+(hi-lo)/2;
while (lo<=hi)
{
int s=0,nrop=1;
for (int i=1;i<=n;i++)
{
s+=v[i];
if (s>mi)
{
s=v[i];
nrop++;
}
if (nrop>k)
{
lo=mi+1;
mi=lo+(hi-lo)/2;
break;
}
}
if (nrop<=k)
{
cmax=mi;
hi=mi-1;
mi=lo+(hi-lo)/2;
}
}
fout << cmax;
return 0;
}
