Cod sursa(job #2070622)
| Utilizator | Data | 19 noiembrie 2017 19:19:36 | |
|---|---|---|---|
| Problema | Transport | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.65 kb |
#include <iostream>
# include <fstream>
using namespace std;
int main()
{
int n,k, s[16000],i,c, nrt,ct,gata=0;
ifstream fin("transport.in");ofstream fout("transport.out");
fin>>n >> k;
for (i=0;i<n;i++)
fin>>s[i];
c=s[0];
for(i=1;i<n;i++)
if (s[i]>c) c=s[i];
do
{nrt=k;i=0;
do
{ct=0;
do {ct+=s[i];i++;}
while ((ct>=c)||(i<n));
if ((ct>c)&&(i<n)) i--;
nrt--;
}
while (nrt>=0);
if (i==n-1) gata=1;
else c++;
}
while (gata);
fout <<c;
return 0;
}
