Cod sursa(job #2165010)
| Utilizator | Data | 13 martie 2018 10:48:14 | |
|---|---|---|---|
| Problema | Secventa 2 | Scor | 40 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.5 kb |
#include <fstream>
using namespace std;
ifstream in("secv2.in");
ofstream out("secv2.out");
int maxSum = -2147483648, sum, i, n, x, beg, endi, idx, k;
int main()
{
in >> n >> k;
for(i = 1; i <= n; i++) {
in >> x;
if(sum < 0) sum = x, idx = i;
else sum += x;
if(maxSum < sum) {
if(i-idx+1 >= k) maxSum = sum, beg = idx, endi = i;
}
}
out << beg << " " << endi << " " << maxSum;
in.close(); out.close();
return 0;
}
