CCF 202006-3 Markdown渲染器

#include <cstring>
#include <string.h>
#include <iostream>
#include <stdio.h>
#include <algorithm>
#include <cmath>
#include <cstring>
#include <string>
#include <vector>
#define ll long long
#define PII pair<int, int>
#define MSI map<string,int>
#define TLE ios::sync_with_stdio(0),cin.tie(0)
#define mod 1000000007
const int INF = 0x3f3f3f3f;
using namespace std;
string Delete_Space(string str) {
	str.erase(0, str.find_first_not_of(' '));
	str.erase(str.find_last_not_of(' ') + 1);
	return str;
}
int main() {
	TLE;
	int w, ans = 0;
	bool flag = false;
	string str = "";
	vector<pair<string, int>> vec;  // 1 新项目列表初始项目 ，2 子项目，3段落
	cin >> w;
	while (getline(cin, str)) {
		if (str.size() == count(str.begin(), str.end(), ' ')) flag = true; //为空行
		else {
			if (flag || vec.empty()) { //上一行为空行时或不存在上一行
				if (str.size() >= 2 && str.substr(0, 2) == string("* ")) //新项目列表初始项目
					vec.push_back(make_pair(Delete_Space(str.substr(2)), 1));
				else //段落
					vec.push_back(make_pair(Delete_Space(str), 3));
				flag = false;
			}
			else { //上一行非空行
				pair<string, int>& last = vec.back();
				if (last.second <= 2) { //上一行为项目
					if (str.size() >= 2 && str.substr(0, 2) == string("  ")) { //项目内容
						last.first += " ";
						last.first += Delete_Space(str.substr(2));
					}
					else if (str.size() >= 2 && str.substr(0, 2) == string("* ")) //子项目
						vec.push_back(make_pair(Delete_Space(str.substr(2)), 2));
					else //段落
						vec.push_back(make_pair(Delete_Space(str), 3));
				}
				else { //上一行为段落			
					if (str.size() >= 2 && str.substr(0, 2) == string("* ")) //新项目列表初始项目
						vec.push_back(make_pair(Delete_Space(str.substr(2)), 1));
					else { //段落内容
						last.first += " ";
						last.first += Delete_Space(str);
					}
				}
			}
		}
	}
	for (int i = 0; i < vec.size(); i++) {
		string str = vec[i].first;
		if (vec[i].second != 2 && i > 0) ans++; //新项目列表初始项目或段落-与上行间隔空行
		if (vec[i].second <= 2) { //项目
			if (str.size() != 0) { //非空行
				for (int i = 0; i < str.size(); i += (w - 3)) {
					while (i < str.size() && str[i] == ' ') i++;
					ans++;
				}
			}
			else ans++; //空行
		}
		else { //段落
			for (int i = 0; i < str.size(); i += w) {
				while (i < str.size() && str[i] == ' ') i++;
				ans++;
			}
		}
	}
	cout << ans << endl;
}