Pagini recente » Cod sursa (job #1969897) | Cod sursa (job #1170231) | Cod sursa (job #1166299) | Cod sursa (job #867196) | Cod sursa (job #657161)
Cod sursa(job #657161)
#include <fstream>
using namespace std;
ifstream f("secventa.in");
ofstream g("secventa.out");
int n, k;
int a[5000010], Deque[5000010];
int st, dr,stm,drm;
long long rez;
int main()
{
int i;
f>>n>>k;
for (i = 1; i <= n; i++)
f>>a[i];
st = 1, dr = 0;
for (i = 1; i <= n; i++)
{
while (st <= dr && a[i] <= a[ Deque[dr] ]) dr--;
Deque[++dr] = i;
if (Deque[st] == i-k) st++;
if (i >= k) if( a[ Deque[st]]>rez){ rez= a[Deque[st]]; stm=Deque[st]; drm=Deque[dr];}
}
g<<stm<<' '<<drm<<' '<<rez;
return 0;
}