Cod sursa(job #2005520)
| Utilizator | Data | 27 iulie 2017 13:02:32 | |
|---|---|---|---|
| Problema | Secventa 2 | Scor | 60 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.65 kb |
#include <iostream>
#include <fstream>
using namespace std;
int v[50005];
int main()
{
ifstream in("secv2.in");
ofstream out("secv2.out");
int n,k,i,j,Max=-1250000005,poz1,poz2,S;
in >> n >> k;
for (i = 1; i<=n; i++)
in >> v[i];
for (i = 1; i<=n; i++)
{
S = 0;
for (j = i; j<=n; j++)
{
S+=v[j];
if (j-i+1 >= k)
if (S>Max)
{
Max = S;
poz1 = i;
poz2 = j;
}
}
}
out << poz1 << " " << poz2 << " " << Max;
return 0;
}
