Pagini recente » Cod sursa (job #1556259) | Cod sursa (job #2674253) | Cod sursa (job #2842563) | Cod sursa (job #2157550) | Cod sursa (job #1187144)
#include <fstream>
using namespace std;
ifstream fin("secv2.in");
ofstream fout("secv2.out");
int n,k,nr,V[50009];
int main()
{
int dco = 1, sol = -1500000000, c1 = 1, c2, sum = 0, zm;
fin >> n >> k;
for(int i=1; i<=n; i++)
{
fin >> V[i];
V[i] = V[i-1] + V[i];
}
for(int i=1; i<=n-k+1; i++)
{
for(int j=i+1; j<=n; j++)
{
if(V[j] > sol && j-i+1 >= k)
{
sol = V[j];
c1 = i;
c2 = j;
}
V[j] = V[j] - V[i];
}
}
fout << c1 << ' ' << c2 << ' ' << sol << '\n';
fout.close();
return 0;
}