Cod sursa(job #2776677)
| Utilizator |  Vlad Patrascu amunnume |
Data | 20 septembrie 2021 17:38:22 |
|---|---|---|---|
| Problema | Transport | Scor | 40 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.34 kb |
#include <fstream>
using namespace std;
ifstream cin("transport.in");
ofstream cout("transport.out");
int n,k,v[16005],i,mx,p=0,s=0;
int main()
{cin>>n>>k;
for(i=1;i<=n;++i)
{cin>>v[i];
mx=max(mx,v[i]);}
while(true)
{p=0; s=0;
for(i=1;i<=n;i++)
{s+=v[i];
if(s>mx) {p++; s=v[i];}}
p++;
if(p>k) mx++;
else break;}
cout<<mx;
return 0;}
