Cod sursa(job #2215142)
Utilizator | Data | 21 iunie 2018 10:08:30 | |
---|---|---|---|
Problema | Secventa 2 | Scor | 90 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.47 kb |
#include <fstream>
using namespace std;
ifstream f("secv2.in");
ofstream g("secv2.out");
int i,l,L,R,ans,x,n,best,k;
int main()
{
f>>n>>k;
f>>best;
ans=best;
l=1;
for(i=2;i<=n;++i)
{
f>>x;
if(best>=0) best+=x;
else l=i, best=x;
if(best>ans && i-l+1>k)
{
ans=best;
L=l;
R=i;
}
}
g<<L<<' '<<R<<' '<<ans<<'\n';
return 0;
}