#include<fstream>
using namespace std;
const int N=100001;


inline void stanga(int i)
{
	if(i-d[dr]==t)
		st++;
}

inline void dreapta(int i)
{
	while(st<=dr  &&  v[d[dr]] + (i-d[dr])*s>=v[i] )
	{
		--dr;
	}
	
inline void adauga(int i)
{
	d[++dr]=i;
}
ifstream in("branza.in");
ofstream out("branza.out");
{
	
//problemele secventa, secvdist, knumere;