FSMM_blog

题目大意：删除最少的字符使字符串成非递减排列 思路：倒着模拟，依次比较删除。（第一次使用了string字符串数组和resize）（get到新技能 #include 万能头函数） #include #define manx 500005 using namespace std; int main() { int n; string s[manx]; cin>>n;

 C. String Manipulation 1.0 time limit per test 3 seconds memory limit per test 256 megabytes input standard input output standard output One popular website developed an u

C. Minimal string time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output Petya recieved a gift of a string s with length

 B. Mike and strings time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output Mike has n strings s1, s2, ..., sn each