Pagini recente » Cod sursa (job #2671539) | Istoria paginii runda/simulare_lot_seniori_1/clasament | Cod sursa (job #1449084) | Cod sursa (job #601546) | Cod sursa (job #1443746)
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("secv2.in");
ofstream out("secv2.out");
int n, m;
int a, b;
int v[50001];
int s[50001];
int main()
{
in>>n>>m;
int max = -9999999;
for(int i = 0; i<n; i++)
{
in>>v[i];
if(i>0)
s[i]=s[i-1]+v[i];
else s[0]=v[0];
if(i>m && s[i]>max)
{
max = s[i];
a = 0;
b = i;
}
}
int sumC;
for(int i = 0 ; i<n-m; i++)
{
for(int j = i+m; j < n; j++)
{
s[j]-=v[i];
if(s[j]>max)
{
max=s[j];
a = i +1;
b = j;
}
}
}
out<<a+1<<" "<<b+1<<" "<<max;
return 0;
}