Pagini recente » Cod sursa (job #392163) | Cod sursa (job #2808299) | Cod sursa (job #50505) | Cod sursa (job #1655172) | Cod sursa (job #1316326)
#include <fstream>
#include <string>
using namespace std;
ifstream f("secventa.in");
ofstream g("secventa.out");
int front=1,back=1,d[500001],v[500001],n,k,minim,pi,pf;
char s[5000100];
void chg()
{
int semn, j, r;
j = 1;
for (int i = 0; s[i] != 0; i++)
{
semn = 1;
r = 0;
if (s[i] == '-')
{
semn = -1;
i++;
}
while (s[i] >= '0' && s[i] <= '9')
{
r = r * 10 + s[i] - '0';
i++;
}
v[j] = r * semn;
j++;
}
}
int main()
{
f>>n>>k; f.get();
f.getline(s, 5000100);
chg();
minim=-40000;
for(int i=1;i<=n;i++)
{
while(front <= back && v[i]<=v[d[back]])
back--;
d[++back]=i;
if(i-k == d[front])
front++;
if(i>=k && minim<v[d[front]])
{
minim=v[d[front]];
pi=i-k+1;
pf=i;
}
}
g<<pi<<" "<<pf<<" "<<minim;
}