Cod sursa(job #2431196)
Utilizator | Data | 18 iunie 2019 15:26:23 | |
---|---|---|---|
Problema | Secventa 2 | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.58 kb |
#include<bits/stdc++.h>
using namespace std;
ifstream fin("secv2.in");
ofstream fout("secv2.out");
long long sum[50001];
int n,i,p,pi,pf,k,s=INT_MAX,maxsum=INT_MIN;
int main()
{
fin>>n>>k;
for(i=1; i<=n; ++i)
{
fin>>sum[i];
sum[i]+=sum[i-1];
}
for(i=k; i<=n; ++i)
{
if(sum[i-k]<s)
{
s=sum[i-k];
p=i-k+1;
}
if(sum[i]-s>maxsum)
{
maxsum=sum[i]-s;
pi=p;
pf=i;
}
}
fout<<pi<<" "<<pf<<" "<<maxsum;
return 0;
}