Cod sursa(job #2433462)

Utilizator GabyD002Dobrita Gabriel GabyD002 Data 27 iunie 2019 15:18:26
Problema Secventa Scor 100
Compilator cpp-64 Status done
Runda Arhiva de probleme Marime 1.64 kb
#include <bits/stdc++.h>
#define NM 500005
using namespace std;
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;
	}
};
InParser f("secventa.in");
ofstream g("secventa.out");
deque <pair<int,int>> coada;
int main()
{   int n,k;
    f>>n>>k;
    int dr,eMax=-30005;
    for(int x,i=1; i<=n; i++)
    {   f>>x;
        bool ok=true;
        while(!coada.empty() && ok)
        {   int ul=coada.back().first;
            ok=false;
            if(x<=ul)
            {   ok=true;
                coada.pop_back();
            }
        }
        coada.push_back({x,i});
        if(coada.front().second==i-k) coada.pop_front();
        if(i>=k && coada.front().first>eMax)
        {   eMax=coada.front().first;
            dr=i;
        }
    }
    g<<dr-k+1<<' '<<dr<<' '<<eMax;
    return 0;
}