Cod sursa(job #983536)
Utilizator | Data | 12 august 2013 08:54:54 | |
---|---|---|---|
Problema | Secventa 2 | Scor | 40 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.45 kb |
#include<fstream>
using namespace std;
ifstream f("secv2.in"); ofstream g("secv2.out");
int n,k,i,j;
long long s[50004];
int main()
{ f>>n>>k;
int st=0,dr=k;
long long smaxk=-2000000000,spmin=2000000000;
for(i=1;i<=n;++i)
{ f>>s[i];
s[i]+=s[i-1];
if(s[i]<spmin) spmin=s[i], st=i;
if(s[i]-spmin>smaxk && i-st+1>=k) smaxk=s[i]-spmin, dr=i;
}
g<<st+1<<' '<<dr<<' '<<smaxk<<'\n'; g.close(); return 0;
}