最終更新日：2025/11/30
During the seminar, the professor illustrated a simsun permutation with an example to show how the subsequence of the smallest k elements never contains three consecutive entries in decreasing order for any k.
正解を見る
During the seminar, the professor illustrated a simsun permutation with an example to show how the subsequence of the smallest k elements never contains three consecutive entries in decreasing order for any k.
音声機能が動作しない場合はこちらをご確認ください
編集履歴（0）
