Cod sursa(job #2392724)
| Utilizator | Data | 30 martie 2019 12:25:27 | |
|---|---|---|---|
| Problema | Secventa | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | excelenta-tema3 | Marime | 0.48 kb |
#include <fstream>
using namespace std;
ifstream in("secventa.in");
ofstream out("secventa.out");
int n,k,v[500001],p,u;
int main()
{
in>>n>>k;
int m=0;
for(int i=1;i<=n;i++)
in>>v[i];
for(int i=1;i<=n-k+1;i++)
{ int msec=30000;
for(int j=i;j<=i+k-1;j++)
{
if(v[j]<msec)msec=v[j];
}
if(msec>m){m=msec;
p=i;u=i+k-1;}
}
out<<p<<' '<<u<<' '<<m;
return 0;
}
