Cod sursa(job #1533930)
| Utilizator | Data | 23 noiembrie 2015 08:48:26 | |
|---|---|---|---|
| Problema | Secventa | Scor | 30 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.57 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("secventa.in");
ofstream g("secventa.out");
int main()
{
short x[500001];
int n,k,i,mini,mini2=-31002,j,r,t;
f>>n>>k;
for(i=1;i<=n;i++)
f>>x[i];
for(i=1;i<=n-k+1;i++)
{
mini=31000;
for(j=i;j<=i+k-1;j++)
if(x[j]<mini)
mini=x[j];
if(mini>mini2)
{
mini2=mini;
r=i;
t=i+k-1;
}
}
g<<r<<' '<<t<<' '<<mini2;
return 0;
}
