HDUOJ 2577 How to type

最新推荐文章于 2022-02-14 13:20:49 发布

Chen丶HC

最新推荐文章于 2022-02-14 13:20:49 发布

阅读量199

点赞数

分类专栏： DAG动态规划文章标签： hduoj

本文链接：https://blog.csdn.net/chcnsn/article/details/76552048

版权

DAG动态规划专栏收录该内容

8 篇文章 0 订阅

订阅专栏

#ifdef _DEBUG
#pragma warning(disable : 4996)
#endif
#include <iostream>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <algorithm>
#include <functional>
#include <sstream>
#include <utility>
#include <cstring>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <cmath>
#include <cctype>
#define CLEAR(a, b) memset(a, b, sizeof(a))
#define CLOSE() ios::sync_with_stdio(false)
#define IN() freopen("in.txt", "r", stdin)
#define OUT() freopen("out.txt", "w", stdout)
#define PF(a) printf("%d\n", a)
#define SF(a) scanf("%d", &a)
#define SFF(a, b) scanf("%d%d", &a, &b)
#define FOR(i, a, b) for(int i = a; i < b; ++i)
#define LL long long
#define MAXN 1005
#define MAXM 1000010
#define mod 1000007
#define INF 1000000000
using namespace std;
//------------------------------------------------------------------------------------------//
//由记忆化到dp

string s;
int dp[MAXN][2];

int solve(int pos, bool cur) {
	int &ret = dp[pos][cur];
	if (ret) return ret;
	if (pos == s.size()) return 0;
	ret = 0;

	if (isupper(s[pos])) {
		if (cur) ret = min(solve(pos + 1, !cur) + 2, solve(pos + 1, cur) + 1);
		else ret = min(solve(pos + 1, cur), solve(pos + 1, !cur)) + 2;
	}
	else {
		if (cur) ret = min(solve(pos + 1, !cur), solve(pos + 1, cur)) + 2;
		else ret = min(solve(pos + 1, !cur) + 2, solve(pos + 1, cur) + 1);
	}

	if (pos == s.size() - 1 && cur) ret++;
	return ret;
}

int main() {
	int T; SF(T);
	while (T--) {
		CLEAR(dp, 0);
		cin >> s;
		dp[s.size()][0] = 0, dp[s.size()][1] = 1;
		for (int i = s.size() - 1; i >= 0; --i) {
			if (isupper(s[i])) {
				dp[i][1] = min(dp[i + 1][0] + 2, dp[i + 1][1] + 1);
				dp[i][0] = min(dp[i + 1][0], dp[i + 1][1]) + 2;
			}
			else {
				dp[i][1] = min(dp[i + 1][0], dp[i + 1][1]) + 2;
				dp[i][0] = min(dp[i + 1][1] + 2, dp[i + 1][0] + 1);
			}
		}
		PF(min(dp[0][0], dp[0][1]+1));
	}
	return 0;
}