$O(n^2)$
#include<cstdio> int n, a[100]; int main() { scanf("%d", &n); for (int i = 0, j, x; i < n; i++) { scanf("%d", &x); for (j = i; j > i - x; j--) a[j] = a[j - 1]; a[j] = i + 1; } for (int i = 0; i < n; i++) printf("%d ", a[i]); return 0; }
#include<cstdio> int n, a[100]; int main() { scanf("%d", &n); for (int i = 0, j, x; i < n; i++) { scanf("%d", &x); for (j = i; j > i - x; j--) a[j] = a[j - 1]; a[j] = i + 1; } for (int i = 0; i < n; i++) printf("%d ", a[i]); return 0; }
댓글 없음 :
댓글 쓰기