E - Tree and Hamilton Path 2 (AtCoder Beginner Contest 361)

Поделиться
HTML-код
  • Опубликовано: 29 окт 2024

Комментарии •

  • @prajjawalsingh4952
    @prajjawalsingh4952 3 месяца назад

    nice explanation 👍

  • @PubgMerabeta
    @PubgMerabeta 3 месяца назад +1

    Bro can you explain C and D prb too?

    • @soumyabhattacharjee1051
      @soumyabhattacharjee1051  3 месяца назад

      D is kind of a simple breadth-first search, so have not covered it, you can check my solution atcoder.jp/contests/abc361/submissions/55280719 and ask me if there is any doubt
      For C you can think about having a subsequence of N-K elements, so we can sort it and consider every subarray of size n-k. Here is my solution atcoder.jp/contests/abc361/submissions/55269760