Pagini recente » Cod sursa (job #2893141) | Cod sursa (job #607566) | Cod sursa (job #1993463) | Istoria paginii runda/hardcore/clasament | Cod sursa (job #320814)
Cod sursa(job #320814)
#include<deque>
#include<string>
#include<fstream>
#include<vector>
using namespace std;
ifstream f("secventa.in");
ofstream g("secventa.out");
int n,k,i,x,sf,in,Max=-40000;
deque <int> Q;
vector <int> a;
string str;
string ::iterator it,End;
inline int Nr()
{
int nr=0;
while('0'<=*it&&*it<='9')
{
nr=nr*10-'0'+*it;
if(it==End)
break;
it++;
}
return nr;
}
void parse()
{
std::getline(f,str,'\n');
std::getline(f,str,'\n');
it=str.begin();End=str.end()-1;
while(it!=End)
{
while(*it==' ') it++;
if(*it=='-')
{
it++;
a.push_back(Nr()*-1);
}
else
a.push_back(Nr());
}
}
int main()
{
f>>n>>k;
parse();
for(i=0;i<n;i++)
{
x=a[i];
while(!Q.empty()&&a[Q.back()]>x)
Q.pop_back();
Q.push_back(i);
if(Q.front()==i-k)
Q.pop_front();
if(i+1>=k)
if(a[Q.front()]>Max)
{
Max=a[Q.front()];
in=i-k+2;
sf=i+1;
}
}
g<<in<<' '<<sf<<' '<<Max<<'\n';
return 0;
}