Pagini recente » Cod sursa (job #1349746) | Cod sursa (job #270333) | Cod sursa (job #426058) | Cod sursa (job #1488419) | Cod sursa (job #603036)
Cod sursa(job #603036)
#include<cstdio>
const int maxn=100000005;
int n, k, i, first, last, a[maxn], p, min;
int main()
{ freopen("secventa.in", "r", stdin);
freopen("secventa.out", "w", stdout);
scanf("%d %d", &n, &k);
min=10000001;
for(i=1; i<=n; ++i) { scanf("%d", &a[i]);
if(a[i]<min && a[i]-k>0) { min=a[i];
p=i;
}
}
if(min>=k) { first=p;
last=p;
while(a[--first]>=a[p] && a[first]>=k);
while(a[++last]>=a[p] && a[last]>=k);
++first;
--last;
printf("%d %d %d\n", first, last, min);
}
else printf("-1 -1 %d\n", min);
fclose(stdin);
fclose(stdout);
return 0;
}