Cod sursa(job #2849742)
| Utilizator | Data | 15 februarie 2022 18:06:08 | |
|---|---|---|---|
| Problema | Secventa 2 | Scor | 30 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.66 kb |
#include <fstream>
using namespace std;
ifstream fin("secv2.in");
ofstream fout("secv2.out");
int n, k, v[50005], i, j, sum, summax = -99999999, pozinceput, pozfinal;
int main()
{
fin >> n >> k;
for(i = 1; i <= n; i++)
{
fin >> j;
v[i] = v[i - 1] + j;
}
for(i = 1; i + k <= n; i++)
{
for(j = i + k; j <= n; j++)
{
if(v[j] - v[i] > summax)
{
summax = v[j] - v[i];
pozinceput = i + 1;
pozfinal = j;
}
}
}
fout << pozinceput << ' ' << pozfinal << ' ' << summax << '\n';
return 0;
}
