Cod sursa(job #1605021)
| Utilizator | Data | 18 februarie 2016 18:49:28 | |
|---|---|---|---|
| Problema | Secventa 2 | Scor | 40 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.67 kb |
#include <iostream>
#include <fstream>
#include <limits>
#include <cmath>
//#define L_MAX 10000000
using namespace std;
ifstream f("secv2.in");
ofstream g("secv2.out");
//long long int v[L_MAX], mx[L_MAX+1], w[L_MAX];
int main()
{
long int n, i, y, s, mn, smax=0, sol=-1, nr, poz, st, dr, k;
f>>n>>k;
// mx[0]=0;
for(i=1; i<=n; i++)
{
f>>nr;
if(smax<0)
{
smax=nr;
poz=i;
}
else smax+=nr;
if(smax>sol && i-poz>=k)
{
sol=smax;
st=poz;
dr=i;
}
}
g<<st<<" "<<dr<<" "<<sol;
return 0;
}
