Cod sursa(job #2861607)
| Utilizator | Data | 4 martie 2022 09:56:05 | |
|---|---|---|---|
| Problema | Secventa | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.51 kb |
#include <iostream>
#include <fstream>
using namespace std;
int main()
{long int n, k, i, j, max1=0, poz, baza, pf;
ifstream f("secventa.in");
ofstream g("secventa.out");
f>>n>>k;
long int a[n];
for(i=0; i<n; i++)
f>>a[i];
for (i=0;i<=n-k;i++)
{
baza=a[i];
poz=i;
for (j=1;j<k;j++)
if (baza>a[i+j])
{
baza=a[i+j];
poz=i+j;
}
if (max1<baza)
{
max1=baza;
pf=i;
}
i=poz;
}
g<<pf+1<<" "<<pf+k<<" "<<max1;
f.close();
g.close();
return 0;
}
