Pagini recente » Cod sursa (job #3363176) | Cod sursa (job #3363209) | Cod sursa (job #3363182) | Cod sursa (job #3363202) | Cod sursa (job #3363159)
#include <bits/stdc++.h>
using namespace std;
ifstream fin ("secventa.in");
ofstream fout ("secventa.out");
int n,k,i,mare,poz;
int main()
{
fin >> n >> k;
vector<int> v(n+1),st(n+1),dr(n+1);
stack<int> s1,s2;
for(i=1;i<=n;i++)
fin >> v[i] ;
for(i=1;i<=n;i++)
{
while(!s1.empty() && v[i]<=v[s1.top()])
s1.pop();
if(s1.empty())
st[i]=-1;
else
st[i]=s1.top();
s1.push(i);
int j=n-i+1;
while(!s2.empty() && v[j]<=v[s2.top()])
s2.pop();
if(s2.empty())
dr[j]=-1;
else
dr[j]=s2.top();
s2.push(j);
}
for(i=1;i<=n;i++)
{
int l,r;
if(st[i]>-1)
l=st[i]+1;
else
l=1;
if(dr[i]>-1)
r=dr[i]-1;
else
r=n;
//cout << i << " " << v[l] << " " << l << " " << v[r] << " " << r << '\n' ;
if(r-l+1>=k && v[i]>mare)
poz=l ,mare=v[i];
}
for(i=poz;i<poz+k;i++)
fout << v[i] << " " ;
return 0;
}