Pagini recente » Cod sursa (job #3259693) | Cod sursa (job #1876142) | Cod sursa (job #2618943) | Cod sursa (job #408137) | Cod sursa (job #2867065)
#include <fstream>
#include <deque>
using namespace std;
class instream {
public:
instream() {}
instream(const char *s) {
input_file=fopen(s,"r");
cursor=0;
fread(buffer,SIZE,1,input_file);
}
inline instream &operator >>(int &n) {
while((buffer[cursor]<'0'||buffer[cursor]>'9')&&buffer[cursor]!='-') {
advance();
}
int semn=1;
if (buffer[cursor]=='-')
semn=-1,advance();
n=0;
while('0'<=buffer[cursor]&&buffer[cursor]<='9') {
n=n*10+buffer[cursor]-'0';
advance();
}
n*=semn;
return *this;
}
private:
FILE *input_file;
static const int SIZE=1<<16;
int cursor;
char buffer[SIZE];
inline void advance() {
++ cursor;
if(cursor==SIZE) {
cursor=0;
fread(buffer,SIZE,1,input_file);
}
}
};
int main()
{
ifstream f ("secventa.in");
ofstream g ("secventa.out");
int n,k,v[500005],mx,dr,st;
deque <int> deq;
f>>n>>k;
mx=-300005;
for (int i=1; i<=n; i++)
{
f>>v[i];
if (!deq.empty() && deq.front()<=i-k)
deq.pop_front();
while (!deq.empty() && v[i]<=v[deq.back()])
deq.pop_back();
deq.push_back(i);
if (i>=k && v[deq.front()]>mx)
{
mx=v[deq.front()];
dr=i;
st=i-k+1;
}
}
g<<st<<' '<<dr<<' '<<mx;
}