Pagini recente » Cod sursa (job #2887539) | Cod sursa (job #316679) | Cod sursa (job #470208) | Cod sursa (job #2544130) | Cod sursa (job #1736322)
#include <fstream>
using namespace std;
ifstream fin("secventa.in");
ofstream fout("secventa.out");
struct qq{int val; int id;};
qq deq[500005];
long long n, k, i, bk, fr, x, fi;
int sum;
int main()
{
fin>>n>>k;
fr=1; bk=0;
deq[0].val=(-1)*1000000;
for (i=1; i<=n; i++)
{
fin>>x;
while (bk>=fr && deq[bk].val>=x)
bk--;
deq[++bk].val=x;
deq[bk].id=i;
if (deq[fr].id==i-k)
fr++;
if (k<=i)
{
if(deq[fr].val>sum)
{
sum=deq[fr].val;
fi=i;
}
}
}
fout<<fi-2<<" "<<fi<<" "<<sum;
return 0;
}