[理工] [離散] 鴿籠 97北大
Using the pigeonhole principle, show that
a list of n^2 + 1 distinct numbers,
there are either n+1 numbers (not necessarily consecuitve)
in increasing order
or
n+1 numbers in decreasing order.
(For example, in the list1, 5, 3, 4, 2,
we have both the increasing list 1, 3, 4
and the decreasing lists 5, 4, 2 and 5, 3, 2.)
想了好久想不出來
只有想到要分n個一組，最後會多出一個
可是沒辦法找到鴿子數，沒辦法把牠門趕進去籠子Orz
--
推
,
→
,
--
※ 發信站: 批踢踢實業坊(ptt.cc)
◆ From: 61.228.131.165
討論串 (同標題文章)
以下文章回應了本文：
完整討論串 (本文為第 1 之 2 篇)：