Pagini recente » Cod sursa (job #351168) | Cod sursa (job #1745428) | Cod sursa (job #2246726) | Cod sursa (job #1038559) | Cod sursa (job #1123122)
#include <fstream>
#include <deque>
#include <cstring>
using namespace std;
ifstream is("secventa.in");
ofstream os("secventa.out");
int n, k;
int a[500005];
int en, ma = -0x3f3f3f3f;
char s[3500005];
deque<int> q;
void READ();
int main()
{
READ();
/*for ( int i = 1; i <= n; ++i )
is >> a[i];*/
for ( int i = 1; i <= n; ++i )
{
if ( !q.empty() && q.front() + k == i )
q.pop_front();
while ( !q.empty() && a[i] < a[q.back()] )
q.pop_back();
q.push_back(i);
if ( k <= i && a[q.front()] > ma )
{
ma = a[q.front()];
en = i;
}
}
os << en - k + 1 << " " << en << " " << ma;
is.close();
os.close();
return 0;
}
void READ()
{
is >> n >> k;
is.get();
is.getline(s, 3500005, '\n');
int m = strlen(s) - 1;
int cnt = 1, semn;
for ( int i = 0; i <= m; ++i )
{
semn = 1;
if ( s[i] == '-' )
{
semn = -1;
++i;
}
while ( s[i] != ' ' && i <= m )
{
a[cnt] = a[cnt] * 10 + ( s[i] - '0' );
++i;
}
a[cnt] *= semn;
++cnt;
}
}