Cod sursa(job #2369834)
Utilizator | Data | 6 martie 2019 09:25:56 | |
---|---|---|---|
Problema | Transport | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.4 kb |
#include <fstream>
using namespace std;
ifstream f("transport.in");
ofstream g("transport.out");
long n,i,j,k,a[16001],s,smax,d;
int main()
{
f>>n>>k;
for(i=1;i<=n;i++)
f>>a[i];
for(i=1;i<=k;i++)
{
for(j=1;j<=i;j++)
{
d++;
s=s+a[d];
}
if(s>smax)
smax=s;
s=0;
}
g<<smax;
return 0;
}