Cod sursa(job #1979651)
Utilizator | Vulsan Bianca Maria BiancaMariaVulsan | Data | 10 mai 2017 23:12:36 |
---|---|---|---|
Problema | Secventa 2 | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.52 kb |
#include <iostream>
#include <fstream>
#include <limits.h>
using namespace std;
ifstream f("secv2.in");
ofstream g("secv2.out");
int n, v[50001],k,i,smax,best,minn,p,st=1,dr;
int main()
{
f>>n>>k; smax=INT_MIN;
for(i=1; i<=n; i++)
{f>>v[i];
v[i]=v[i-1]+v[i];
if(i>=k)
{best=v[i]-minn;
if(minn>v[i-k]) {minn=v[i-k]; p=i-k;}
if(smax<best) {smax=best; dr=i; st=p+1;}
}
}
g<<st<<' '<<dr<<' '<<smax<<'\n';
f.close();
g.close();
return 0;
}