Cod sursa(job #3253821)
| Utilizator | Data | 4 noiembrie 2024 21:49:03 | |
|---|---|---|---|
| Problema | Secventa 2 | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.58 kb |
#include <iostream>
using namespace std;
//ifstream cin("secv2.in");
//ofstream cout("secv2.out");
int A[50005];
int main()
{
long long n, k, i, maxi= -2000000000;
cin >> n>> k;
for(i= 1;i <= n;i++)
cin >> A[i];
int st , dr, Smax = -2000000000 , S = -1, start;
for(int i = 1 ; i <= n ; ++ i)
{
if(S < 0)
S = 0, start = i;
S += A[i];
if(S > Smax and k <= i- start+ 1)
Smax = S, st = start, dr = i;
}
cout << st << " " << dr<< " ";
cout << Smax;
return 0;
}
