题目大意是一个序列a[i]要求满足a[i]>0,a[i]>=2*a[i-1]且a[n]<=k,现给出n和k,求所有满足条件的序列的数量。
用f[i,j]表示第i个数以j结尾的序列数量,则f[i,j]=∑f[i-1,k](2^(i-2)<=k<=j/2),边界条件是f[1,i]=1。ans=∑f[n,j](2^(n-1)<=j<=k);
1653745 2008-10-02 12:41:29 Accepted 2402 FPC 50 424 IwfWcf
题目大意是一个序列a[i]要求满足a[i]>0,a[i]>=2*a[i-1]且a[n]<=k,现给出n和k,求所有满足条件的序列的数量。
用f[i,j]表示第i个数以j结尾的序列数量,则f[i,j]=∑f[i-1,k](2^(i-2)<=k<=j/2),边界条件是f[1,i]=1。ans=∑f[n,j](2^(n-1)<=j<=k);
1653745 2008-10-02 12:41:29 Accepted 2402 FPC 50 424 IwfWcf
qihang0922,kate spade handbags
回复删除gucci shoes
michael kors
nike air force 1
nike air huarache
ray ban outlet
adidas superstar
tod's shoes
insanity workout
christian louboutin
ugg slippers
adidas original trainers
coach outlet store online
juicy couture
soccer shoes
p90x workouts
nike huarache trainers
longchamp pas cher
mont blanc pens
ghd
ray bans
prada
adidas originals
abercrombie
cheap oakley sunglasses
north face
cheap versace
oakley sunglasses
true religion outlet
giuseppe zanotti sneakers
canada goose uk
gucci
ed hardy uk
nike roshe run
lebron james shoes
q
zhengjx20160520
回复删除retro jordans 13
jordan 3 powder blue
designer handbags
nike trainers sale
hollister clearance
nike store outlet
coach outlet
cheap jordans
christian louboutin sale
michael kors outlet
kobe 8
michael kors bags
oakley outlet
michael kors handbags
oakley outlet
louis vuitton handbags
retro 11
michael kors outlet
cheap oakley sunglasses
louis vuitton outlet
kd 7 shoes
ray bans
tiffany and co
nfl jerseys
michael kors outlet
jordan retro 8
coach factory outlet online
toms wedges
ray ban sunglasses
michael kors
copy watches
louis vuitton bags
coach outlet store online clearances
cheap ray ban sunglasses
fitflop clearance
michael kors outlet
north face jackets
cheap oakleys
burberry outlet online
michael kors purses