Pagini recente » Cod sursa (job #3130579) | Cod sursa (job #2111047) | Cod sursa (job #864481) | Cod sursa (job #470397) | Cod sursa (job #2033873)
#include <fstream>
#include <deque>
#define maxi 5000005
using namespace std;
ifstream fi ("secventa.in");
ofstream fo ("secventa.out");
deque <int> d;
int n,k,v[maxi],mi=-99999,dr;
long long suma;
int main()
{
fi>>n>>k;
for(int i=1; i<=n; i++)
fi>>v[i];
for(int i=1; i<=n; i++)
{
if(i<k)
{
while(!d.empty() && v[i]<=v[d.back()])
d.pop_back();
d.push_back(i);
}
else
{
while(!d.empty() && v[i]<=v[d.back()])
d.pop_back();
d.push_back(i);
if(d.front() <= i-k)
d.pop_front();
if(v[d.front()]>mi) {
mi=v[d.front()];
dr=i;
}
}
}
fo<<dr-k+1<<" "<<dr<<" "<<mi;
fi.close();
fo.close();
return 0;
}
///https://pastebin.com/eBBKVrBr