Cod sursa(job #1122466)
Utilizator | Data | 25 februarie 2014 18:17:29 | |
---|---|---|---|
Problema | Secventa 2 | Scor | 70 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.61 kb |
#include <fstream>
using namespace std;
ifstream is("secv2.in");
ofstream os("secv2.out");
int n, k, a[50001], s[50001];
int be, en, ma = -0x3f3f3f3f;
int main()
{
is >> n >> k;
for ( int i = 1; i <= n; ++i )
{
is >> a[i];
s[i] = s[i - 1] + a[i];
for ( int j = 1; j < i - k + 1; ++j )
{
if ( s[i] - s[j - 1] > ma )
{
be = j;
en = i;
ma = s[i] - s[j - 1];
}
}
}
os << be << " " << en << " " << ma;
is.close();
os.close();
return 0;
}