Pagini recente » Cod sursa (job #1568000) | Cod sursa (job #1278074) | Cod sursa (job #1919020) | Cod sursa (job #2649604) | Cod sursa (job #1729775)
#include <fstream>
#define ll long long
using namespace std;
int n,k;
ll s[50005];
int main()
{
ifstream fin("secv2.in");
ofstream fout("secv2.out");
fin>>n>>k;
int m;
for(int i=1;i<=n;i++) {
fin>>m;
s[i]=s[i-1]+m;
}
ll smin=0,smax=-25000*(k+1);
int pmin=0,st=1,dr=1;
for(int i=k;i<=n;i++) {
if(s[i]-smin>smax) {
smax=s[i]-smin;
st=pmin+1;
dr=i;
}
if(s[i-k+1]<smin)
smin=s[i-k+1],pmin=i-k+1;
}
fout<<st<<" "<<dr<<" "<<smax;
return 0;
}