P3558 [POI2013]BAJ-Bytecomputer(线性dp)

最新推荐文章于 2024-09-28 22:05:59 发布

eva_can(not)survive

最新推荐文章于 2024-09-28 22:05:59 发布

阅读量172

点赞数

分类专栏： DP 洛谷学习文章标签：算法

本文链接：https://blog.csdn.net/Ghostttttttiii/article/details/124498678

版权

洛谷学习同时被 2 个专栏收录

202 篇文章 0 订阅

订阅专栏

71 篇文章 0 订阅

订阅专栏

[POI2013]BAJ-Bytecomputer - 洛谷https://www.luogu.com.cn/problem/P3558我认为这是一道很好的线性dp题，状态转移时要考虑很多情况，需要细心，做完这题之后也有很多感悟

#include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <cstring>
#include <set>
#include <unordered_map>
#include <cmath>
#include <map>
#include <cctype>
#include <cstdlib>
#include <deque>
typedef long long ll;
typedef unsigned long long ull;
using namespace std;
const int MN = 65005;
const int MAXN = 1000010;
const int INF = 0x3f3f3f3f;
#define IOS ios::sync_with_stdio(false)
#define lowbit(x) ((x)&(-x))

const int mod = 19650827;
int n;
int s[MAXN];
int f[MAXN][3];
int main() {
	scanf("%d", &n);
	for (int i = 1; i <= n; i++) {
		scanf("%d", s + i);
	}
	f[1][0] = f[1][1] = f[1][2] = INF;
	f[1][s[1] + 1] = 0;
	for (int i = 2; i <= n; i++) {
		if (s[i] == -1) {
			f[i][0] = f[i - 1][0];
			if (s[i - 1] == 1) {
				f[i][1] = min(f[i - 1][0], f[i - 1][1]) + 1;
			} else {
				f[i][1] = INF;
			}
			if (s[i - 1] == 1) {
				f[i][2] = min(f[i-1][0], min(f[i-1][1], f[i-1][2])) + 2;
			} else {
				f[i][2] = f[i - 1][2] + 2;
			}
		} else if (s[i] == 0) {
			f[i][0] = f[i - 1][0] + 1;
			f[i][1] = min(f[i - 1][1], f[i - 1][0]);
			if (s[i - 1] == 1) {
				f[i][2] = min(f[i - 1][0], min(f[i - 1][1], f[i - 1][2])) + 1;
			} else {
				f[i][2] = f[i - 1][2] + 1;
			}
		} else if (s[i] == 1) {
			f[i][0] = f[i - 1][0] + 2;
			if (s[i - 1] == -1) {
				f[i][1] = min(f[i - 1][0], f[i - 1][1]) + 1;
			} else {
				f[i][1] = f[i - 1][0] + 1;
			}
			f[i][2] = min(f[i - 1][0], min(f[i - 1][1], f[i - 1][2]));
		}
	}
	int ans = min(f[n][0], min(f[n][1], f[n][2]));
	if (ans >= INF)
		printf("BRAK");
	else
		printf("%d", ans);
	return 0;
}