Cod sursa(job #2765761)
Utilizator | Data | 29 iulie 2021 20:41:45 | |
---|---|---|---|
Problema | Secventa | Scor | 60 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.5 kb |
#include <fstream>
using namespace std;
ifstream in("secventa.in");
ofstream out("secventa.out");
int n,k,mi,j,a[500005],i,inc,st[500005];
int main()
{
in>>n>>k;
mi=-1000000;
j=1;
for (i=1;i<=n;++i)
{
in>>a[i];
while (a[i]<st[st[0]]&&st[0]>=j) st[0]--;
st[0]++;
st[st[0]]=a[i];
if (i>k) {if (st[j]==a[i-k]) j++;}
if (i>=k) {if (st[j]>mi) {mi=st[j]; inc=i;}}
}
out<<inc-k+1<<" "<<inc<<" "<<mi;
return 0;
}