Pagini recente » Cod sursa (job #1645379) | Cod sursa (job #3189303) | Cod sursa (job #1395620) | Cod sursa (job #1852083) | Cod sursa (job #1533917)
#include <fstream>
#include <deque>
#include <iostream>
#include <sstream>
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,k,o;
stringstream ss;
string s;
int main()
{
fin>>n>>d;
ans = -31000;
fin.get();
getline(fin,s);
o = 1;
for( i = 1 ; i <= n ; i++ )
{
if( s[ k ] == ' ' )
{
k++;
o = 1;
}
if( s[ k ] == '-' )
{
o = -1;
k++;
}
while( s[ k ] != ' ' && k < s.length() )
{
v[ i ] = v[ i ] * 10 + s[ k ] - '0';
k++;
}
v[ i ] = v[ i ] * o;
}
for( i = 1 ; i < d ; i++ )
{
while( deq.size() && v[ deq.back() ] >= v[ i ] )
{
deq.pop_back();
}
deq.push_back( i );
}
for( i = d ; i <= n ; 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;
}