Cod sursa(job #2215151)
| Utilizator | Data | 21 iunie 2018 10:43:37 | |
|---|---|---|---|
| Problema | Secventa 2 | Scor | 40 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.64 kb |
#include<iostream>
#include<fstream>
using namespace std;
ifstream f("secv2.in");
ofstream g("secv2.out");
int N,k;
int main(){
int i, a;
int start = 0, end = 0, sum = 0, best =-1<<31, mps = 1 << 30, mpsi = 1;
f >> N >> k;
for (i = 1; i <= N; i++) {
f >> a;
sum += a;
if (best < sum - mps) {
best = sum - mps;
start = mpsi + 1;
end = i;
}
if (mps > sum && mps-mpsi+1>=k) {
mps = sum;
mpsi = i;
}
}
if (k==N)g<<1<<" "<<N<<" "<<sum;
else g << start << ' ' << end << ' ' << best;
return 0;
}
