Cod sursa(job #2909157)
Utilizator | Sandor Stefan stefan24 | Data | 9 iunie 2022 17:52:48 |
---|---|---|---|
Problema | Secventa | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.5 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("secventa.in");
ofstream g("secventa.out");
deque<int>q;
int v[500005];
int main()
{
int n,k,poz,mx=-1e9;
f>>n>>k;
for(int i=1;i<=n;++i)
{
f>>v[i];
if(q.size() and v[i]<=v[q.back()])q.pop_back();
if(q.size() and q.front()<=i-k)q.pop_front();
q.push_back(i);
if(i>=k and v[q.front()]>mx)mx=v[q.front()],poz=i;
}
g<<poz-k+1<<" "<<poz<<" "<<mx;
}