摘要:
【动态规划专练-区间DP】CF149D(1900) 题目大意: 给出能够配对的括号序列,按以下要求给括号上色: 一对括号必有一个染色,一个无色 相邻的有色括号不能是相同的颜色 求上色方案数目,对1e9+7取模 思路: 由这一句 “ it is possible to obtain a correct 阅读全文
摘要:
#Marvolo Gaunt's Ring Professor Dumbledore is helping Harry destroy the Horcruxes. He went to Gaunt Shack as he suspected a Horcrux to be present ther 阅读全文
摘要:
#Cut Ribbon time limit per test1 second memory limit per test256 megabytes inputstandard input outputstandard output Polycarpus has a ribbon, its leng 阅读全文
摘要:
#Multiplicity You are given an integer array a1,a2,…,an. The array b is called to be a subsequence of a if it is possible to remove some elements from 阅读全文
摘要:
题干: You are given an integer nn. In 11 move, you can do one of the following actions: erase any digit of the number (it's acceptable that the number b 阅读全文