Cod sursa(job #3310373)
| Utilizator | Data | 13 septembrie 2025 11:25:02 | |
|---|---|---|---|
| Problema | Secventa 2 | Scor | 90 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.69 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("secv2.in");
ofstream fout("secv2.out");
long long v[50001];
int main()
{
long long n, k, ma=-25005, l, r;
fin>>n>>k;
for(int i=1;i<=n;i++)
{
fin>>v[i];
v[i]+=v[i-1];
}
int st=0;
for(int i=k;i<=n;i++)
{
if(v[i]-v[st]>ma)
{
ma=v[i]-v[st];
l=st+1;
r=i;
}
if(v[i]-v[st]==ma && st+1<l)
{
l=st+1;
r=i;
}
if(v[i-k+1]<v[st])
{
st=i-k+1;
}
}
fout<<l<<" "<<r<<" "<<ma;
return 0;
}
