我们定义一个英文词组的首字母缩写为：取出词组中每个单词的第一个字母、全部转化成大写并顺次连接。
于是小X想请你帮忙写一个程序，读入一行英文句子，将用括号括出的词组替换为首字母缩写再输出。
The (longest increasing subsequence) problem can be solved with (dynamic programming), and optimized with (binary indexed tree).The LIS problem can be solved with DP, and optimized with BIT.