Pagini recente » Cod sursa (job #209652) | Cod sursa (job #263022) | Cod sursa (job #1603903) | Cod sursa (job #3267525) | Cod sursa (job #2529241)
#include<fstream>
using namespace std;
int n,k,i,min[500001],v[500001],ma,p,u,st,dr;
ifstream f("secventa.in");
ofstream g("secventa.out");
int main()
{
f >> n >> k;
ma = -30001;
for(i = 1;i <= n; ++i)
f >> v[i];
p = u = 1;
min[p] = 1;
for(i = 2; i <= n; ++i)
{
while(p <= u && v[i] <= v[min[u]])
u--;
u++;
min[u] = i;
while(p <= u && i - min[p] >= k)
p++;
if(v[min[p]] > max && i >= k)
{
ma = v[min[p]];
dr = i;
}
}
g << dr - k + 1 << " " << dr << " " << ma;
return 0;
}