Pagini recente » Cod sursa (job #2935114) | Cod sursa (job #2070838) | Cod sursa (job #2098097) | Cod sursa (job #351436) | Cod sursa (job #238189)
Cod sursa(job #238189)
#include <fstream>
using namespace std;
ifstream f ("secventa.in");
ofstream g ("secventa.out");
int main()
{
long long *n=new long long;
long long *k=new long long;
f>>*n>>*k;
int *v=new int[500000];
for(int i=0;i<*n;i++) f>>v[i];
int *min_max= new int;
*min_max=v[0];
int *min=new int;
int *x=new int;
for(int i=0;i<*n-*k+1;i++)
{
*min=v[i];
for(int j=i;j<i+*k;j++) if(v[j]<*min) *min=v[j];
if(*min>*min_max) *min_max=*min,*x=i;
}
g<<*x+1<<" "<<*x+*k<<" "<<*min_max;
f.close();
g.close();
return 0;
}