Cod sursa(job #2816582)
| Utilizator | Data | 11 decembrie 2021 17:15:23 | |
|---|---|---|---|
| Problema | Secventa 2 | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.6 kb |
#include <fstream>
#include <iostream>
using namespace std;
ifstream in("secv2.in");
ofstream out("secv2.out");
long long n,k,x[50100],M,st,dr,p,s,se;
int main() {
in>>n>>k;
for(int i=1;i<=k;i++)
{
in>>x[i];
s+=x[i];
}
st=1;
dr=k;
M=s;
p=1;
for(int i=k+1;i<=n;i++)
{
in>>x[i];
s+=x[i];
se+=x[i-k];
if(s-se>s)
{
s-=se;
se=0;
p=i-k+1;
}
if(s>M)
{
M=s;
st=p;
dr=i;
}
}
out<<st<<' '<<dr<<' '<<M;
return 0;
}
