You are given:
* a positive integer n,
* an integer k, 1<=k<=n,
* an increasing sequence of k integers 0 < s1 < s2 < ... < sk <=
2n.
What is the number of proper bracket expressions of length 2n with
opening brackets appearing in positions s1, s2,...,sk?
plz.. explain how to solve this problem
thanks in advance
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send email to algoge...@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
