Pagini recente » Cod sursa (job #508) | Cod sursa (job #1550288) | Cod sursa (job #3152889) | Cod sursa (job #1333829) | Cod sursa (job #2120495)
#include <fstream>
using namespace std;
ifstream f("secventa.in");
ofstream g("secventa.out");
int n,k,poz,maxim,st,dr,i;
int v[500010],Deque[500010];
int main()
{
f>>n>>k;
for(i=1;i<=n;i++)
f>>v[i];
st=1;
maxim=-30010;
for(i=1;i<=n;i++)
{
while(st<=dr&&v[i]<v[Deque[dr]])
dr--;
Deque[dr++]=i;
if(i-Deque[st]==k)
st++;
if(i>=k&&v[Deque[st]]>maxim)
{
maxim=v[Deque[st]];
poz=i;
}
}
g<<poz-k+1<<" "<<poz<<" "<<maxim;
return 0;
}