摘要:
令dp[i]表示,以第i个点为转折点,i前面全部是大写,后面全部是都是小写的代价,自然等于i前面的小写+i后面的大写。(i自己是大写还是小写无所谓,可以没有代价的归入大写或者小写) 阅读全文
摘要:
待修莫队。(用奇偶优化真的能快300ms!) 阅读全文
摘要:
莫队。 统计ai[i]的出现次数,每一次先还原贡献,再加上或减去当前的贡献即可。 阅读全文
摘要:
动态开点线段树+dp。 题目转换成求$x_i$ include include include include include include include include include include include // include include include pragma GCC 阅读全文