Pagini recente » Cod sursa (job #1502656) | Cod sursa (job #381192) | Cod sursa (job #2402136) | Cod sursa (job #889408) | Cod sursa (job #1805551)
#include <fstream>
using namespace std;
ifstream fin ("secventa.in");
ofstream fout ("secventa.out");
short v[500010],minim=-31000;
int n,k,i,D[500010],pozi,pozj,p,u;
int main () {
fin>>n>>k;
for(i=1;i<=n;i++)
fin>>v[i];
p=1;
u=1;
D[1]=1;
for(i=2;i<=n;i++){
while(v[i]<=v[D[u]] && p<=u)
u--;
D[++u]=i;
if(i-D[p]>=k)
p++;
if(i>=k && v[D[p]]>minim){
minim=v[D[p]];
pozi=i-k+1;
pozj=i;
}
}
fout<<pozi<<" "<<pozj<<" "<<minim;
}