Cod sursa(job #862560)
Utilizator | Dinu Radu RaduGabriel2012 | Data | 22 ianuarie 2013 19:35:41 |
---|---|---|---|
Problema | Secventa 2 | Scor | 90 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.4 kb |
#include <fstream>
#include <iostream>
using namespace std;
ifstream f("secv2.in");
ofstream g("secv2.out");
int i,a[50001],n,k,st=0,dr=0,l,r;
long long mx;
int main()
{f>>n>>k;
for(i=1;i<=n;i++) {f>>a[i];a[i]+=a[i-1];}
mx=a[k];st=1;dr=k;
for(i=k;i<=n;i++)
{if ((a[i]-a[i-k])>(a[i]-a[st-1])) st=i-k+1;
if ((a[i]-a[st-1])>mx) {mx=a[i]-a[st-1];l=st;r=i;}
}
g<<l<<" "<<r<<" "<<mx;
return 0;
}