Pagini recente » Cod sursa (job #1931715) | Cod sursa (job #1665336) | Cod sursa (job #1699458) | Cod sursa (job #2935350) | Cod sursa (job #741824)
Cod sursa(job #741824)
#include <iostream>
#include <fstream>
#include <deque>
#include <sstream>
using namespace std;
const char infile[] = "secventa.in";
const char outfile[] = "secventa.out";
#define NMAX 500001
struct NumberInfo
{
int value;
int position;
NumberInfo()
{
}
NumberInfo(int value, int position)
{
this->value = value;
this->position = position;
}
};
NumberInfo elements[NMAX];
class Deque
{
public:
Deque(int maxSize)
{
this->_start = -1;
this->_end = -1;
this->_elements = (NumberInfo *) &elements;
}
~Deque()
{
}
NumberInfo front()
{
return this->_elements[_start];
}
NumberInfo back()
{
return this->_elements[_end];
}
bool empty()
{
if(_end < _start || this->_start == -1)
return true;
return false;
}
void pop_back()
{
this->_end --;
}
void push_back(NumberInfo element)
{
if(this->empty() == true)
{
this->_start = 0;
this->_end = -1;
}
this->_end++;
this->_elements[_end] = element;
}
void pop_front()
{
this->_start++;
}
protected:
private:
int _start;
int _end;
NumberInfo *_elements;
};
void solve( istream &cin, ostream &cout )
{
int sequenceLength;
int numbersCount;
cin >> numbersCount
>> sequenceLength;
//deque<NumberInfo> deq;
Deque deq(numbersCount);
int currentNumber;
int sequenceStart;
int sequenceBase;
cin >> currentNumber;
deq.push_back(NumberInfo(currentNumber, 0));
for(int i = 1; i < sequenceLength; i++)
{
cin >> currentNumber;
while(deq.empty() == false && deq.back().value > currentNumber)
{
deq.pop_back();
}
deq.push_back(NumberInfo(currentNumber, i));
}
sequenceStart = 0;
sequenceBase = deq.front().value;
for(int i = sequenceLength; i < numbersCount; i++)
{
cin >> currentNumber;
if(deq.front().position <= i - sequenceLength)
{
deq.pop_front();
}
while(deq.empty() == false && deq.back().value > currentNumber)
{
deq.pop_back();
}
deq.push_back(NumberInfo(currentNumber, i));
if(deq.front().value > sequenceBase)
{
sequenceBase = deq.front().value;
sequenceStart = i - sequenceLength + 1;
}
}
sequenceStart += 1;
cout << sequenceStart << " "
<< sequenceStart + sequenceLength - 1 << " "
<< sequenceBase << "\n";
}
int main(int argc, char* argv[])
{
fstream fin(infile, ios::in);
fstream fout(outfile, ios::out);
solve(fin, fout);
fin.close();
fout.close();
}