Cod sursa(job #1971788)
| Utilizator | Data | 20 aprilie 2017 22:37:46 | |
|---|---|---|---|
| Problema | Secventa 2 | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.7 kb |
#include <iostream>
#include <fstream>
#include <limits>
using namespace std;
ifstream fin("secv2.in");
ofstream fout("secv2.out");
const int NMax=50005;
int x[NMax],N,i,poz,sol,st=1,dr=1,K;
void Read(){
fin>>N>>K;
for(i=1;i<=N;i++)
{
fin>>x[i];
x[i]+=x[i-1];
}
}
void Solve(){
dr=K;
sol=x[K];
for(int i=K+1;i<=N;i++)
{
if(x[i-K]<x[poz])
poz=i-K;
if(x[i]-x[poz]>sol)
{
sol=x[i]-x[poz];
st=poz+1;
dr=i;
}
}
fout<<st<<' '<<dr<<' '<<sol<<'\n';
}
int main()
{
Read();
Solve();
return 0;
}
