Pagini recente » Cod sursa (job #1161147) | Cod sursa (job #1250202) | Cod sursa (job #3292610) | Cod sursa (job #1358919) | Cod sursa (job #1169885)
#include <fstream>
#include <deque>
using namespace std;
#define NMax 500005
#define inf 2100000000
ifstream f("secventa.in");
ofstream g("secventa.out");
int n,k,mx=-inf,j;
int v[NMax];
deque<int> dq;
void afis()
{
for(deque<int>::iterator it=dq.begin();it!=dq.end();it++) g<<v[*it]<<" ";
g<<"\n";
}
int main()
{
int i;
f>>n>>k;
for(i=1;i<=n;i++)
{
f>>v[i];
while(!dq.empty() && v[i]<=v[dq.back()]) dq.pop_back();
dq.push_back(i);
while(dq.front()<=i-k) dq.pop_front();
if(i>=k && v[dq.front()]>mx)
{
j=i;
mx=v[dq.front()];
}
}
g<<j-k+1<<" "<<j<<" "<<mx<<"\n";
f.close();
g.close();
return 0;
}