Pagini recente » Cod sursa (job #2563170) | Cod sursa (job #663450) | Cod sursa (job #2819050) | Cod sursa (job #45181) | Cod sursa (job #1533737)
#include <fstream>
#include <deque>
#include <iostream>
using namespace std;
ifstream fin("secventa.in");
ofstream fout("secventa.out");
deque<int> deq;
int i,j,n,m,ans,x,y,v[500010],d;
int main()
{
fin>>n>>d;
for( i = 1 ; i < d ; i++ )
{
fin>>v[ i ];
while( deq.size() && v[ deq.back() ] >= v[ i ] )
{
deq.pop_back();
}
deq.push_back( i );
}
for( i = d ; i <= n ; i++ )
{
fin>>v[ i ];
while( deq.size() && v[ deq.back() ] >= v[ i ] )
{
deq.pop_back();
}
deq.push_back( i );
if( deq.front() < i - d + 1 )
deq.pop_front();
m = deq.front();
if( v[ deq.front() ] > ans )
{
ans = v[ deq.front() ];
x = i - d + 1;
y = i;
}
}
fout<<x<<' '<<y<<' '<<ans;
return 0;
}