Cod sursa(job #1955574)
| Utilizator | Data | 6 aprilie 2017 08:19:31 | |
|---|---|---|---|
| Problema | Secventa | Scor | 30 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.47 kb |
#include <fstream>
using namespace std;
ifstream f("secventa.in");
ofstream g("secventa.out");
int n,i,a[600000],maxi,p,j,nr,k,c;
int main()
{
f>>n>>k;
for (i=1;i<=n;i++) f>>a[i];
maxi=-30000;
for (i=1;i<=n-k+1;i++)
{
nr=30000;
for (j=i;j<i+k;j++) if (a[j]<nr) nr=a[j];
c=nr;
if (c>maxi)
{
maxi=c;
p=i;
}
}
g<<p<<' '<<p+k-1<<' '<<maxi<<'\n';
return 0;
}
