Cod sursa(job #3205595)
Utilizator | Data | 20 februarie 2024 10:31:26 | |
---|---|---|---|
Problema | Secventa | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.4 kb |
#include<fstream>
using namespace std;
ifstream F("secventa.in");
ofstream G("secventa.out");
int n,i,k,l,t,d[500001],p,q;
short a[500001],j=-31e3;
int main()
{
for(F>>n>>k,i=1;i<=n;++i) {
for(F>>a[i];p<q&&a[i]<=a[d[q]];--q);
if(d[q++]=i,i-k>=d[p])
++p;
if(i>=k&&a[d[p]]>j)
j=a[d[p]],l=i-k+1,t=i;
}
return G<<l<<' '<<t<<' '<<j,0;
}