Pagini recente » Cod sursa (job #1188200) | Cod sursa (job #1271556) | Cod sursa (job #1562337) | Cod sursa (job #1168992) | Cod sursa (job #2642984)
#include <fstream>
using namespace std;
ifstream in("secventa.in");
ofstream out("secventa.out");
int n,k,mi,j,a[1000005],i,inc,st[1000005];
int main()
{
in>>n>>k;
mi=-1000000;
j=1;
for (i=1;i<=n;++i)
{
in>>a[i];
while (a[i]<st[st[0]]&&st[0]>=j) st[0]--;
st[0]++;
st[st[0]]=a[i];
if (i>k) {if (st[j]==a[i-k]) j++;}
if (i>=k) {if (st[j]>mi) {mi=st[j]; inc=i-k+1;}}
}
for (i=inc;true;i++)
{
if (a[i]<mi) {i--; break;}
if (i==n) break;
}
out<<inc<<" "<<i<<" "<<mi;
return 0;
}