Pagini recente » Cod sursa (job #72113) | Cod sursa (job #352505) | Cod sursa (job #2448913) | Cod sursa (job #984004) | Cod sursa (job #2396872)
#include <fstream>
#define N 500001
using namespace std;
ifstream fin("secventa.in");
ofstream fout("secventa.out");
int x;
int n,k,p1,p2;
int v[N],maxi=-30000;
int main()
{
fin>>n>>k;
for(int i=1;i<=n;i++)
{
fin>>v[i];
}
for(int i=1;i<=n-k+1;i++)
{
int j=i+1;
int ct=1;
while(v[i]<v[j]&&j<=n)
{
ct++;
j++;
}
if(v[i]>maxi&&ct>=k)
{
maxi=v[i];p1=i;
p2=j-1;
}
else if(v[i]==maxi&&ct>=k)
{
if(i<p1)
{
p1=i;
p2=j-1;
}
else if(i==p1&&j-1<p2)
p2=j-1;
}
}
fout<<p1<<" "<<p2<<" "<<maxi;
return 0;
}