Pagini recente » Cod sursa (job #1411083) | Cod sursa (job #1691742) | Cod sursa (job #2717518) | Cod sursa (job #1794391) | Cod sursa (job #274075)
Cod sursa(job #274075)
#include<fstream>
using namespace std;
int v[500010],deque[500010],k,n,i,p,u;
int main()
{
ifstream f("secventa.in");
ofstream g("secventa.out");
f>>n>>k;
for(i=1;i<=n;i++) f>>v[i];
p=u=1;
for(i=1;i<=n;i++)
{
while(deque[p]<=i-k && p<=u) p++;
while(v[i]<v[deque[u]] && p<=u) u--;
deque[++u]=i;
}
g<<deque[p]<<" "<<deque[p]+k-1<<" "<<v[deque[p]];
f.close();
g.close();
return 0;
}