Cod sursa(job #1937731)
| Utilizator | Data | 24 martie 2017 10:37:00 | |
|---|---|---|---|
| Problema | Secventa | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.53 kb |
#include <iostream>
#include <fstream>
using namespace std;
int n,k,v[500000],i,j,nr,mn,mn1,mx=0,p;
int main()
{
ifstream f("secventa.in");
ofstream g("secventa.out");
f>>n>>k;
for (i=1;i<=n;i++)
{
f>>v[i];
}
for (i=1;i<=n;i++)
{
nr=1;
j=i;
mn=v[i];
while(nr<=k)
{
if (v[j]<mn) {mn=v[j];j++;nr++;}
else {j++;nr++;}
}
if (mn>mx) {p=i;mx=mn;}
}
cout <<p<<" "<<p+k-1<<" "<<mx;
return 0;
}
