Cod sursa(job #2551898)
Utilizator | Data | 20 februarie 2020 12:26:04 | |
---|---|---|---|
Problema | Secventa 2 | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.47 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("secv2.in");
ofstream g("secv2.out");
int n,k,x,ii;
long long dps[50005],summax,sum;
int main()
{
f>>n>>k;
for(int i=1;i<=n;i++)
{
f>>x;
if(i>=k)
dps[i]=x+dps[i-1]-dps[i-k];
else dps[i]=x;
if(dps[i]>summax)
{
ii=i;
summax=dps[i];
}
}
g<<ii-k-1<<" "<<ii<<" "<<summax;
return 0;
}