Pagini recente » Cod sursa (job #2903506) | Cod sursa (job #326494) | Cod sursa (job #1910463) | Cod sursa (job #2587382) | Cod sursa (job #2090369)
#include <fstream>
#include <deque>
#include <sstream>
#include <cstdio>
#include <cctype>
using namespace std;
struct Numar
{
int valoare;
int pozitie;
};
class InParser {
private:
FILE *fin;
char *buff;
int sp;
char read_ch() {
++sp;
if (sp == 4096) {
sp = 0;
fread(buff, 1, 4096, fin);
}
return buff[sp];
}
public:
InParser(const char* nume) {
fin = fopen(nume, "r");
buff = new char[4096]();
sp = 4095;
}
InParser& operator >> (int &n) {
char c;
while (!isdigit(c = read_ch()) && c != '-');
int sgn = 1;
if (c == '-') {
n = 0;
sgn = -1;
} else {
n = c - '0';
}
while (isdigit(c = read_ch())) {
n = 10 * n + c - '0';
}
n *= sgn;
return *this;
}
InParser& operator >> (long long &n) {
char c;
n = 0;
while (!isdigit(c = read_ch()) && c != '-');
long long sgn = 1;
if (c == '-') {
n = 0;
sgn = -1;
} else {
n = c - '0';
}
while (isdigit(c = read_ch())) {
n = 10 * n + c - '0';
}
n *= sgn;
return *this;
}
};
int main()
{
int numarNumere, lungimeSecventa;
InParser fin("secventa.in");
fin >> numarNumere >> lungimeSecventa;
int inceputSecventa=0, sfarsitSecventa=0, bazaMaxima=-30001;
deque<Numar> dequeCrescator;
for(int i=1; i<=numarNumere; ++i)
{
Numar numar;
fin >> numar.valoare;
numar.pozitie = i;
while(!dequeCrescator.empty() && numar.valoare <= dequeCrescator.front().valoare)
dequeCrescator.pop_front();
dequeCrescator.push_front(numar);
if(dequeCrescator.back().pozitie == i-lungimeSecventa)
dequeCrescator.pop_back();
if(i>=lungimeSecventa && dequeCrescator.back().valoare>bazaMaxima)
{
bazaMaxima = dequeCrescator.back().valoare;
inceputSecventa = i-lungimeSecventa+1;
sfarsitSecventa = i;
}
}
ofstream fout("secventa.out");
fout << inceputSecventa << ' ' << sfarsitSecventa << ' ' << bazaMaxima;
return 0;
}