Cod sursa(job #567129)
Utilizator | Andrei Mihu AndreiMihu | Data | 29 martie 2011 19:08:51 |
---|---|---|---|
Problema | Secventa 2 | Scor | 60 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.6 kb |
#include<fstream.h>
ifstream f("secv2.in");
ofstream g("secv2.out");
int a[50000],s[50000],n,k,S,i,j,max,st,dr;
int main()
{ f>>n>>k;
for(i=1;i<=n;i++) { f>>a[i];
s[i]=s[i-1]+a[i];
}
for(i=k;i<=n;i++) for(j=0;j<i;j++) if(s[i]-s[j]>max&&i-j>=k) { max=s[i]-s[j];
st=j+1;
dr=i;
}
g<<st<<" "<<dr<<" ";
for(i=st;i<=dr;i++) S+=a[i];
g<<S<<"\n";
f.close();
g.close();
return 0;
}