Pagini recente » Cod sursa (job #223748) | Cod sursa (job #3230031) | Cod sursa (job #2721921) | Cod sursa (job #2223351) | Cod sursa (job #1041598)
#include <fstream>
#include <deque>
#include <vector>
using namespace std;
deque <int> d;
int i,n,k,b,a[500001],l,u,semn,j,val;
long long s=-300000;
ifstream f("secventa.in");
ofstream g("secventa.out");
string s1;
char c;
int main()
{
f>>n>>k;
f.get();
getline(f,s1);
semn=1,val=0;
s1=s1+' ';
u=s1.length();
while(j<u)
{
if (s1[j]==' ') a[++i]=val*semn,semn=1,val=0;
if (s1[j]>='0' && s1[j]<='9') val=val*10+s1[j]-'0';
if (s1[j]=='-') semn=-1;
j++;
}
for (i=1;i<=n;i++)
{
while (!d.empty() && a[d.back()]>=a[i]) d.pop_back();
d.push_back(i);
if (i-k==d.front()) d.pop_front();
if (i>=k && a[d.front()]>s)
{
l=i;
s=a[d.front()];
}
}
g<<l-k+1<<" "<<l<<" "<<s<<endl;;
return 0;
}