Pagini recente » Cod sursa (job #3274659) | Borderou de evaluare (job #1265810) | Cod sursa (job #3275160) | Cod sursa (job #3190027) | Cod sursa (job #2762673)
#include <fstream>
#include <set>
using namespace std;
ifstream in ("secventa.in");
ofstream out ("secventa.out");
multiset<int>Set;
multiset<int>:: iterator it;
multiset<int>:: iterator it1;
int v[500005];
int main()
{
int n,k,i1=1,i,i2,maxim=-30000,start,finish;
in>>n>>k;
for (i=1;i<=n;i++)
{
in>>v[i];
Set.insert(v[i]);
i2=i;
it=Set.begin();
if(i2-i1+1==k)
{
if((*it)>maxim)
{
maxim=(*it);
start=i1;
finish=i2;
}
it1=Set.find(v[i1]);
Set.erase(it1);
i1++;
}
}
out<<start<<" "<<finish<<" "<<maxim;
return 0;
}