Cod sursa(job #3239027)
| Utilizator | Data | 1 august 2024 14:53:36 | |
|---|---|---|---|
| Problema | Secventa 2 | Scor | 10 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.49 kb |
#include <fstream>
using namespace std;
ifstream fin("secv2.in");
ofstream fout("secv2.out");
int N,K,i,smax,st,dr,Sp[50009];
int main()
{
fin>>N>>K;
for(i=1; i<=N; i++)
{
fin>>Sp[i];
Sp[i]=Sp[i]+Sp[i-1];
}
smax=-20000000;
for(i=1; i<=N-K+1; i++)
{
if(Sp[i+K-1]-Sp[i-1]>smax)
{
smax=Sp[i+K-1]-Sp[i-1];
st=i;
dr=i+K-1;
}
}
fout<< st << " " << dr << " " << smax;
}
