Mai intai trebuie sa te autentifici.
Cod sursa(job #1554731)
Utilizator | Data | 21 decembrie 2015 17:42:37 | |
---|---|---|---|
Problema | Secventa 2 | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.69 kb |
#include <fstream>
#define INF 1000000000
using namespace std;
int n, k, i, x, pmaxim, umaxim, minim, maxim, p;
int s[50010];
int main () {
ifstream fin("secv2.in");
ofstream fout("secv2.out");
fin>>n>>k;
minim = INF;
maxim = -INF;
for (i=1;i<=n;i++) {
fin>>x;
s[i] = s[i-1] + x;
if (i >= k) {
if (s[i-k] < minim) {
minim = s[i-k];
p = i-k;
}
if (s[i]-minim > maxim) {
maxim = s[i]-minim;
pmaxim = p+1;
umaxim = i;
}
}
}
fout<<pmaxim<<" "<<umaxim<<" "<<maxim;
return 0;
}