Cod sursa(job #2699918)
| Utilizator | Data | 26 ianuarie 2021 10:39:11 | |
|---|---|---|---|
| Problema | Secventa 2 | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.64 kb |
#include <fstream>
using namespace std;
int main()
{
ifstream cin("secv2.in");
ofstream cout("secv2.out");
long long n, k, maxim = 0, poz, v[500001];
cin >> n >> k;
for (int i = 1; i <= n; ++i)
{
cin >> v[i];
v[i] += v[i - 1];
if (i == k || (i > k && v[i] > maxim))
{
maxim = v[i];
poz = i;
}
}
int mini = 2500000, p;
for (int i = 0; i <= poz - k; ++i)
{
if (v[i] < minim)
{
minim = v[i];
p = i + 1;
}
}
cout << p << " " << poz << " " << maxi - mini;
return 0
