Cod sursa(job #2420169)
| Utilizator | Data | 10 mai 2019 21:04:17 | |
|---|---|---|---|
| Problema | Secventa 2 | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.68 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("secv2.in");
ofstream fout("secv2.out");
long long n , v[50001],ssm[50001],k;
int main()
{
int i;
fin>>n>>k;
for(i=1;i<=n;i++)
fin>>v[i];
ssm[0]=0;
for(i=1;i<=n;i++)
ssm[i]=ssm[i-1]+v[i];
long long st=1,indst=1,inddr=1,ans=INT_MIN,mn=INT_MAX;
for(i=1;i<=n;i++)
{
if(i-k>=0 && ssm[i-k]<mn )
{
mn=ssm[i-k];
st=i-k+1;
}
if(ans<ssm[i]-mn)
{
ans=max(ans,ssm[i]-mn);
inddr=i;
indst=st;
}
}
fout<<indst<<" "<<inddr<<" "<<ans<<" ";
return 0;
}
