Pagini recente » Cod sursa (job #2138033) | Cod sursa (job #2738389) | Istoria paginii runda/simulare_oji_10_2/clasament | Cod sursa (job #1311856) | Cod sursa (job #963237)
Cod sursa(job #963237)
#include <fstream>
using namespace std;
ifstream f("secventa.in");
ofstream g("secventa.out");
int a[5100000],n,ok,q,i,p=1,k,u,d[5100000];
long long e=-100000000;
int main()
{
f>>n>>k;
for (i=1;i<=n;i++)
{f>>a[i];
while (p<=u && a[i]<a[d[u]])u--;
d[++u]=i;
while (p<=u && d[p]<=i-k)p++;
if (i>=k && a[d[p]]>e)
{
e=a[d[p]];
q=d[p];
}
}
g<<q-k+1<<" "<<q<<" "<<e;
f.close();
g.close();
}