蓝桥杯模拟题
子串分值
#include <iostream>
#include <algorithm>
using namespace std;
const int N = 30;
const int M = 10005;
int main()
{
string s;
cin >> s;
int n = s.size();
int last[N], left[M], right[M];
fill(last, last + N, -1);
for (int
原创
2021-03-12 11:39:14 ·
76 阅读 ·
0 评论