Pagini recente » Cod sursa (job #2197693) | Cod sursa (job #1734438) | Cod sursa (job #205155) | Cod sursa (job #1031269) | Cod sursa (job #2401350)
#include <fstream>
#include <deque>
#define val first
#define poz second
using namespace std;
ifstream f("secventa.in");
ofstream g("secventa.out");
deque < pair <int, int> > deq;
int ist,ifi,maxi,n,k,i,x;
int main()
{
f>>n>>k;
for(i=1; i<=n; i++){
f>>x;
while ( deq.empty()==false && x<deq.back().val ) deq.pop_back();
deq.push_back(make_pair(x,i));
if(deq.front().poz==i-k) deq.pop_front();
if(deq.front().val>maxi){
maxi=deq.front().val;
ist=i-k+1;
ifi=i;
}
}
g<<ist<< " "<<ifi<<" "<<maxi;
return 0;
}