Pagini recente » Cod sursa (job #1444387) | Cod sursa (job #984980) | Cod sursa (job #1796993) | Rating Boboia Liviu (NuiNimic) | Cod sursa (job #1205040)
#include <fstream>
#include <iostream>
#define MX 500001
#define maxim(a,b) ((a>b) ? a : b)
using namespace std;
ifstream fin("secventa.in");
ofstream fout("secventa.out");
int n,k;
int s[MX], a[MX],m=-32000,start;
void citire()
{
int i;
fin>>n>>k;
for(i=1; i<=n; i++) fin>>a[i];
}
void afisare(int l, int d)
{
for(; l<=d; l++) cout<<a[s[l]]<<' ';
cout<<'\n';
}
int main()
{
int i,x;
int l,d;
l=1;
d=0;
citire();
for(i=1; i<=n; i++)
{
while(l<=d && a[i]<=a[s[d]]) d--;
s[++d] = i;
if(s[l] == i-k) l++;
if(a[s[l]] > m && i>=k)
{
m = a[s[l]];
start = maxim(1, i-k+1);
}
//afisare(l,d);
}
fout<<start<<' '<<start+k-1<<' '<<m;
fin.close(); fout.close();
return 0;
}