Pagini recente » Cod sursa (job #2183036) | Cod sursa (job #2854654) | Cod sursa (job #1446322) | Cod sursa (job #1853429) | Cod sursa (job #1278296)
#include<fstream>
#include<deque>
#define INF 100001
#define NMAX 500001
using namespace std;
int n,k,i,poz,st,dr;
int a[NMAX];
deque<int>d;
int main()
{
ifstream f("secventa.in");
ofstream g("secventa.out");
f>>n>>k;
for (i=1;i<=n;++i) f>>a[i];
a[0]=-INF;
for (i=1;i<=n;++i)
{
while(!d.empty() && a[i]<=a[d.back()]) d.pop_back();
d.push_back(i);
if (d.front()==i-k) d.pop_front();
if (i>=k)
if (a[d.front()]>a[poz])
{
poz=d.front();
dr=i;
st=dr-k+1;
}
}
g<<st<<' '<<dr<<' '<<a[poz];
return 0;
}