Cod sursa(job #2358176)
Utilizator | Data | 27 februarie 2019 22:02:43 | |
---|---|---|---|
Problema | Transport | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.34 kb |
#include <fstream>
using namespace std;
ifstream f("transport.in");
ofstream g("transport.out");
int n,k,i,s,smax,a[16010],j,d;
int main()
{
f>>n>>k;
for(i=1;i<=n;i++)
f>>a[i];
for(i=1;i<=k;i++)
{for(d=1;d<=i;d++)
{j++;
s=s+a[j];
}
if(s>smax)
smax=s;
s=0;
}
g<<smax;
}