Cod sursa(job #1248139)
Utilizator | Moise Alexandru moise_alexandru | Data | 24 octombrie 2014 18:40:03 |
---|---|---|---|
Problema | Deque | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.62 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("deque.in");
ofstream out("deque.out");
long long d[10000001];
int main()
{
long long k,n;
long long mnf=100000000;
long long pi=1,ps=1;
long long mnsecv=100000000;
in>>n>>k;
for(long long i=1;i<=n;i++)
{
long long x;
in>>x;
ps++;
d[ps]=x;
mnsecv=d[pi];
mnf=min(mnf,mnsecv);
if(ps-pi>k)
pi++;
while(d[ps]<=d[ps-1] && ps>=pi)
{
d[ps-1]=d[ps];
ps--;
}
}
out<<mnf;
return 0;
}