Cod sursa(job #2036694)
| Utilizator | Data | 10 octombrie 2017 22:44:19 | |
|---|---|---|---|
| Problema | Secventa 2 | Scor | 90 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.59 kb |
#include <bits/stdc++.h>
#define Nmax 50001
using namespace std;
ifstream f("secv2.in");
ofstream g("secv2.out");
int v[Nmax];
int main()
{
int n,k,i;
f>>n>>k;
for(i=1;i<=n;i++)
{
f>>v[i];
v[i]+=v[i-1];
}
int minn=0,maxx=0,pmax=0,pmin=0;
for(i = 1; i <= n - k; i++)
{
if(maxx<v[i+k]-minn)
{
maxx=v[i+k]-minn;
pmax=i+k;
}
if(minn>v[i])
{
minn=v[i];
pmin=i;
}
}
g<<pmin+1<<' '<<pmax<<' '<<maxx;
return 0;
}
