源代碼\用動態(tài)規(guī)劃算法計算序列關(guān)系個數(shù)
用關(guān)系"<"和"="將3個數(shù)a，b，c依次序排列時，有13種不同的序列關(guān)系：
a=b=c,a=b<c,a<b=v,a<b<c,a<c<b
a=c<b,b<a=c,b<a<c,b<c<a,b=c<a
c<a=b,c<a<b,c<b<a
若要將n個數(shù)依序列，設(shè)計一個動態(tài)規(guī)劃算法，計算出有多少種不同的序列關(guān)系，
要求算法只占用O(n),只耗時O(n*n).
標(biāo)簽：
lt
源代碼
動態(tài)規(guī)劃
序列
上傳時間：
2013-12-26
上傳用戶：siguazgb
The government of a small but important country has decided that the alphabet needs to be streamlined and reordered. Uppercase letters will be eliminated. They will issue a royal decree in the form of a String of B and A characters. The first character in the decree specifies whether a must come ( B )Before b in the new alphabet or ( A )After b . The second character determines the relative placement of b and c , etc. So, for example, "BAA" means that a must come Before b , b must come After c , and c must come After d .
Any letters beyond these requirements are to be excluded, so if the decree specifies k comparisons then the new alphabet will contain the first k+1 lowercase letters of the current alphabet.
Create a class Alphabet that contains the method choices that takes the decree as input and returns the number of possible new alphabets that conform to the decree. If more than 1,000,000,000 are possible, return -1.
Definition
標(biāo)簽：
government
streamline
important
alphabet
上傳時間：
2015-06-09
上傳用戶：weixiao99
上下文無關(guān)文法（Context-Free Grammar, CFG）是一個4元組G=(V, T, S, P)，其中，V和T是不相交的有限集，S∈V，P是一組有限的產(chǎn)生式規(guī)則集，形如A→α，其中A∈V，且α∈(V∪T)*。V的元素稱為非終結(jié)符，T的元素稱為終結(jié)符，S是一個特殊的非終結(jié)符，稱為文法開始符。
設(shè)G=(V, T, S, P)是一個CFG，則G產(chǎn)生的語言是所有可由G產(chǎn)生的字符串組成的集合，即L(G)={x∈T* | Sx}。一個語言L是上下文無關(guān)語言（Context-Free Language, CFL），當(dāng)且僅當(dāng)存在一個CFG G，使得L=L(G)。 *⇒
例如，設(shè)文法G：S→AB
A→aA|a
B→bB|b
則L(G)={a^nb^m | n,m>=1}
其中非終結(jié)符都是大寫字母，開始符都是S，終結(jié)符都是小寫字母。
標(biāo)簽：
Context-Free
Grammar
CFG
上傳時間：
2013-12-10
上傳用戶：gaojiao1999
