Cod sursa(job #2074138)
| Utilizator | Data | 24 noiembrie 2017 09:34:41 | |
|---|---|---|---|
| Problema | Transport | Scor | 80 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.53 kb |
#include <fstream>
using namespace std;
ifstream in ("transport.in");
ofstream out ("transport.out");
const int N=16002;
int v[N],n,k;
int verif(int l)
{
int i,s=0,cnt=1;
for (i=1;i<n;i++)
{
s+=v[i];
if (l<s+v[i+1])
cnt++, s=0;
}
if (cnt>k)
return 0;
return 1;
}
int main()
{
int i,r=0,pas=1<<30;
in>>n>>k;
for (i=1;i<=n;i++)
in>>v[i];
while (pas)
{
if (verif(r+pas)==0)
r+=pas;
pas/=2;
}
out<<r+1;
return 0;
}
