Cod sursa(job #3131631)
Utilizator | Nicoara Lorena lorenanicoara | Data | 20 mai 2023 19:23:16 |
---|---|---|---|
Problema | Secventa 2 | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.65 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("secv2.in");
ofstream fout("secv2.out");
int n,i,j,minim=0,st,dr,imin; long long maxim=LLONG_MIN,k;
long long v[6000002];
int main()
{
fin>>n>>k;
for(i=1; i<=n; i++)
fin>>v[i];
for(i=1; i<=n; i++)
v[i]=v[i-1]+v[i];
for(i=k; i<=n; i++)
{
if(v[i]-minim>maxim)
{
maxim=v[i]-minim;
dr=i;
st=imin+1;
}
if(v[i-k+1]<minim)
{
minim=v[i-k+1];
imin=i-k+1;
}
}
fout<<st<<" "<<dr<<" "<<v[dr]-v[st-1];
return 0;
}