https://ac.nowcoder.com/acm/contest/322/M#include <iostream>#include <cstdio>#include <cstring>#include <algorithm>#include <queue&gt

题目链接：https://leetcode-cn.com/problems/longest-palindromic-substring/submissions/题目：返回给定串的最长回文子串。为了方便分析，用字 '#’ 表示空字符，那么对于字符串 s = "aabcdefg"，可以表示成 _s = "#a#a#b#c#d#e#f#g#"。显然，对于长度为n的字符串s，可能的回文串的中心有n ...

#include <iostream>#include <cstdlib>#include <cstdio>#include <cstring>#include <algorithm&g

把一个强联通分量缩成一个点，点的话费是分量中所有点的话费的最小值，看新图中入度为0的点有多少个，把这些点的话费加起来就行#include <iostream>#include <cstdio>#include <cstring>#include <algorithm>#include <cmath>#include <s...