Pagini recente » Istoria paginii runda/simulare_oji_2023_clasa_9_15_martie | Cod sursa (job #138729)
Cod sursa(job #138729)
#include <stdio.h>
int n, v[5001], a[5001], t[5001], k, ok[5001];
void afis(int i)
{
printf("%d ",i);
if (i != t[i]){ i = t[i]; afis(i);}
}
int main()
{
freopen("subsir2.in","r",stdin);
freopen("subsir2.out","w",stdout);
int i, j, min, poz, p;
scanf("%d",&n);
for (i = 1; i <= n; i++) scanf("%d", v + i);
a[n] = 1;
t[n] = n;
for (i = n - 1; i >= 1; i--)
{
min = k = 10000 ; p = 0;
for (j = i + 1; j <= n; j++)
{
if (j - i > 1)if (k >= v[j - 1] && v[j - 1] >= v[i]) k = v[j - 1], p = j - 1;
if (v[i] <= v[j] && a[j] <= min )
{
if (k < v[i] || k > v[j]) min = a[j], poz = j;
}
if (v[i] <= v[j]) ok[j] = 1;
}
if (min != 10000)
{
t[i] = poz;
a[i] = min + 1;
}
else a[i] = 1, t[i] = i;
}
min = 10000;
for (i = 1; i <= n; i++) if (a[i] < min && !ok[i]) min = i;
printf("%d\n",a[min]);
afis(min);
printf("\n");
return 0;
}