Cod sursa(job #2350054)
| Utilizator | Data | 20 februarie 2019 23:34:43 | |
|---|---|---|---|
| Problema | Secventa | Scor | 30 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.58 kb |
#include <fstream>
using namespace std;
ifstream f("secventa.in");
ofstream g("secventa.out");
int n,k,i,j,baza,poz1,poz2,maxim=-3000000;
int a[500001];
int main()
{
f>>n>>k;
for (i=1;i<=n;i++)
{
f>>a[i];
if (i>=k)
{
baza=a[i];
for (j=i-1;j>=i-k+1;j--)
baza=min(baza,a[j]);
if (baza>maxim)
{
maxim=baza;
poz1=i-k+1;
poz2=i;
}
}
}
g<<poz1<<" "<<poz2<<" "<<maxim;
return 0;
}
