Pagini recente » Cod sursa (job #941940) | Cod sursa (job #1618009) | Cod sursa (job #1228969) | Cod sursa (job #1406735) | Cod sursa (job #1386924)
#include <fstream>
#include <deque>
using namespace std;
ifstream is("secventa.in");
ofstream os("secventa.out");
deque<int> d;
int a[500001];
int n, k, sol = -30001;
int ind;
int pos;
string p;
int Pars();
int main()
{
is >> n >> k;
is.get();
getline(is, p);
for ( int i = 1; i <= n; ++i )
{
a[i] = Pars();
while ( !d.empty() && a[d.back()] > a[i] )
d.pop_back();
d.push_back(i);
while ( d.front() <= i - k )
d.pop_front();
if ( i >= k && a[d.front()] > sol )
{
sol = a[d.front()];
ind = i;
}
}
os << ind - k + 1 << ' ' << ind << ' ' << sol << '\n';
is.close();
os.close();
return 0;
}
int Pars()
{
int sgn = 0, asw = 0;
if ( p[pos] == '-' )
{
sgn = 1;
++pos;
}
while ( p[pos] >= '0' && p[pos] <= '9' )
{
asw = asw * 10 + p[pos] - '0';
++pos;
}
++pos;
if ( sgn )
return -asw;
return asw;
}