Cod sursa(job #2246940)
Utilizator | Data | 27 septembrie 2018 18:38:42 | |
---|---|---|---|
Problema | Secventa 2 | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.54 kb |
#include<fstream>
using namespace std;
ifstream fin("secv2.in");
ofstream fout("secv2.out");
int v[50001];
int main()
{
int n,k,poz,i,maxim;
fin >> n >> k;
for(i = 1;i <= n;i++){
fin >> v[i];
v[i] += v[i-1];
}
for(i = k,maxim = k;i <= n;i++){
if(v[i] > v[maxim])
maxim = i;
}
for(i = maxim-k,poz = maxim-k;i >= 0;i--){
if(v[i] < v[poz]){
poz = i;
}
}
fout << poz+1 << " " << maxim << " " << v[maxim] - v[poz];
return 0;
}