Pagini recente » Cod sursa (job #1360733) | Cod sursa (job #1333709) | Cod sursa (job #1523352) | Cod sursa (job #2325966) | Cod sursa (job #2205767)
#include <fstream>
using namespace std;
ifstream fin("secventa.in");
ofstream fout("secventa.out");
int n,k,i,p,u,v[500001],q[500001],Max,dr;
int main()
{
fin>>n>>k;
for(i=1;i<=n;i++)
fin>>v[i];
Max=-30001;
p=1;
u=0;
for(i=1;i<=n;i++){
while(p<=u&&v[i]<v[q[u]]){
u--;
}
q[++u]=i;
while(p<=u&&q[u]-q[p]>=k)
p++;
if(i>=k&&v[q[p]]>Max){
Max=v[q[p]];
dr=i;
}
}
fout<<dr-k+1<<" "<<dr<<" "<<Max;
return 0;
}