Cod sursa(job #2417291)
Utilizator | Carol Luca Carol_Luca | Data | 29 aprilie 2019 14:30:54 |
---|---|---|---|
Problema | Secventa 2 | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.64 kb |
/// secventa2
#include <bits/stdc++.h>
using namespace std;
ifstream f("secv2.in");
ofstream g("secv2.out");
int n,k,a[50001],in,inn,sf,sff,s,maxx;
int main()
{
f>>n>>k;
for(int i=1; i<=n; i++)
{
f>>a[i];
a[i]+=a[i-1];
}
sf=sff=k;
maxx=s=a[k];
in=inn=0;
for(int i=k;i<=n;i++)
{
if(a[i-k]<a[in])
in=i-k;
s=a[i]-a[in];
if(s>maxx)
{
maxx=s;
sff=i;
inn=in;
}
}
g<<inn+1<<' '<<sff<<' '<<maxx;
return 0;
}