2008年10月2日星期四

ZJU/ZOJ 2284 Inversion Number 解题报告

题目大意是求n的全排列中逆序对数为k的排列数。

n的全排列可以看作是将n插入n-1的全排列中生成的,而对于n-1的全排列来说,n有n个插入位置,将n插入第i个位置可以增加(n-i)对逆序对。所以可以得到递推式f[i,j]=∑f[i-1,j-k](0<=k<=i-1),边界条件是f[1,0]=1。

1653710    2008-10-02 11:39:31     Accepted    2284    FPC    0    144    IwfWcf

1 条评论:

  1. oakley sunglasses wholesale, http://www.oakleysunglasses-wholesale.us.com/
    ugg boots, http://www.uggbootscheap.eu.com/
    ralph lauren uk, http://www.ralphlaurenoutletuk.org.uk/
    thomas sabo uk, http://www.thomassabos.co.uk/
    michael kors factory outlet, http://www.michaelkorsfactoryoutletonline.com/
    michael kors factory outlet, http://www.michaelkorsfactoryoutlets.in.net/
    michael kors handbags, http://www.michaelkorshandbagsoutletstore.us.com/
    oakley sunglasses, http://www.oakleysunglasseswholesale.in.net/
    oakley, http://www.occhialioakleyoutlets.it/
    oakley sunglasses wholesale, http://www.oakleysunglasseswholesale.us.com/
    tory burch shoes, http://www.toryburchshoesoutlet.com/
    pandora jewelry, http://www.pandorajewelryoutlet.us.com/
    hollister uk, http://www.hollistershirts.co.uk/
    cheap nba jerseys, http://www.nbajerseys.net/
    fitflop, http://www.fitflop.in.net/
    louis vuitton, http://www.borselouisvuittonoutlet.it/
    juicy couture outlet, http://www.juicycoutureoutlet.net/
    coach outlet, http://www.coachoutletus.us/
    oakley sunglasses, http://www.oakley.in.net/
    rolex watches uk, http://www.rolexwatches-uk.co.uk/
    longchamp outlet, http://www.longchampoutlet.name/
    michael kors bags, http://www.michaelkorsbags.uk/
    michael kors outlet, http://www.michaelkors-outlets.us.com/
    ugg boots, http://www.uggbootsclearance.in.net/
    nike air max shoes, http://www.nikeairmaxshoess.co.uk/
    links of london, http://www.linksoflondons.co.uk/
    michael kors outlet, http://www.michaelkorsoutletusa.net/
    designer handbags, http://www.designerhandbags.us.com/
    ray ban sunglasses, http://www.raybansunglass.co.uk/
    1003maoqiuyun

    回复删除

相关文章

 
Creative Commons License
除非另有声明,本网站采用知识共享署名-非商业性使用-相同方式共享 3.0 许可协议授权。