求个时间复杂度低于O(n^2)的做法

学术版

%%%%%%%%%%%
by 菜鸟k @ 2020-05-27 16:21:09


sto@[getchar123](/user/102754) orz
by xiaozengXZ @ 2020-05-27 16:22:23


>被起跳次数都恰好等于它能够被起跳的次数 经过该点的次数恰好等于a[i]?
by 斗神_君莫笑 @ 2020-05-27 16:24:34


@[斗神_君莫笑](/user/138543) 嗯
by getchar123 @ 2020-05-27 16:25:18


@[一叶知秋。](/user/71403)
by 菜鸟k @ 2020-05-27 17:49:42


@[wangrx](/user/104726)
by 菜鸟k @ 2020-05-27 17:49:49


|