Cod sursa(job #1982898)
Utilizator | Data | 20 mai 2017 15:40:12 | |
---|---|---|---|
Problema | Deque | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include <iostream>
using namespace std;
const int N=5e6;
int dq[N+1],v[N+1];
int p=0,u=0;
int main()
{
int n,k,i;
for(i=1;i<=n;i++)
cin>>v[i];
int ans=0;
p = 1;
for(i=1;i<=n;i++){
while(p && u && p<=u&&i-dq[p]>=k)
++p;
while(p && u && p<=u&&v[dq[u]]>=v[i])
--u;
dq[++u]=i;
if(i>=k)
ans = v[dq[p]];
}
return 0;
}