Cod sursa(job #3273956)
Utilizator | Data | 4 februarie 2025 17:00:08 | |
---|---|---|---|
Problema | Transport | Scor | 10 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.47 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("transport.in");
ofstream fout("transport.out");
long long n,v[16016],k,maxim,s,suma;
int main()
{
fin>>n>>k;
for(int i=1; i<=n; i++)
{
fin>>v[i];
s+=v[i];
}
s/=k;
for(int i=1; i<=n; i++)
{
if(suma<s)
suma+=v[i];
else
suma=v[i];
if(maxim<suma)
maxim=suma;
}
fout<<maxim;
return 0;
}