Cod sursa(job #1959718)
| Utilizator | Data | 9 aprilie 2017 20:29:11 | |
|---|---|---|---|
| Problema | Secventa 2 | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.47 kb |
#include <fstream>
using namespace std;
int v[50001],s[50001],Min[50001];
int main()
{ int n,i,k,Max=0,ii,jj;
ifstream f("secv2.in");
ofstream g("secv2.out");
f>>n>>k;
for (i=1;i<=n;++i) {
f>>v[i];
if (Min[i-1]+v[i]>v[i]) Min[i]=v[i];
s[i]=s[i-1]+v[i];
if (Max<s[i]-Min[i-k]) {
Max=s[i]-Min[i-k];
ii=i;
jj=i+k-1;
}
}
g<<Max<<" "<<ii<<" "<<jj;
return 0;
}
