【ARC074E】RGB Sequence(DP)

Description

给你一个长度为 N 的序列和 M 组约束条件 , 每组条件形如L i , R i , X i , 表示序列上的 [L i , R i ] 中恰好有 X i 种颜色 , 现在要你用三种颜
色给这个序列染色 , 求满足所有约束的方案数 .


Solution

dpt,i,j,kdpt,i,j,k表示到第tt位,上一次出现红色/绿色/蓝色的位置为i/j/k,转移非常显然。我们发现t=max(i,j,k)t=max(i,j,k),可以省掉一维。

注意统计答案时要判断是否合法(由于这个一直没有过样例)。


Code

/************************************************
 * Au: Hany01
 * Date: Aug 23rd, 2018
 * Prob: ARC074 E
 * Email: hany01dxx@gmail.com & hany01@foxmail.com
 * Inst: Yali High School
************************************************/

#include<bits/stdc++.h>

using namespace std;

typedef long long LL;
typedef long double LD;
typedef pair<int, int> PII;
#define rep(i, j) for (register int i = 0, i##_end_ = (j); i < i##_end_; ++ i)
#define For(i, j, k) for (register int i = (j), i##_end_ = (k); i <= i##_end_; ++ i)
#define Fordown(i, j, k) for (register int i = (j), i##_end_ = (k); i >= i##_end_; -- i)
#define Set(a, b) memset(a, b, sizeof(a))
#define Cpy(a, b) memcpy(a, b, sizeof(a))
#define x first
#define y second
#define pb(a) push_back(a)
#define mp(a, b) make_pair(a, b)
#define SZ(a) ((int)(a).size())
#define INF (0x3f3f3f3f)
#define INF1 (2139062143)
#define debug(...) fprintf(stderr, __VA_ARGS__)
#define y1 wozenmezhemecaia

template <typename T> inline bool chkmax(T &a, T b) { return a < b ? a = b, 1 : 0; }
template <typename T> inline bool chkmin(T &a, T b) { return b < a ? a = b, 1 : 0; }

inline int read() {
    static int _, __; static char c_;
    for (_ = 0, __ = 1, c_ = getchar(); c_ < '0' || c_ > '9'; c_ = getchar()) if (c_ == '-') __ = -1;
    for ( ; c_ >= '0' && c_ <= '9'; c_ = getchar()) _ = (_ << 1) + (_ << 3) + (c_ ^ 48);
    return _ * __;
}

const int maxn = 305, MOD = 1e9 + 7;

int n, m, l, r, x, dp[maxn][maxn][maxn], Ans;
vector<PII> lmt[maxn];

inline void ad(int& x, int y) { if ((x += y) >= MOD) x -= MOD; }

int main()
{
#ifdef hany01
    freopen("arc074e.in", "r", stdin);
    freopen("arc074e.out", "w", stdout);
#endif

    n = read(), m = read();
    For(i, 1, m) l = read(), r = read(), x = read(), lmt[r].pb(mp(l, x));

    dp[0][0][0] = 1;
    For(i, 0, n) For(j, 0, i) For(k, 0, i) if (dp[i][j][k]) {
        rep(p, SZ(lmt[i])) {
            int sm = 1, l = lmt[i][p].x;
            if (j >= l) ++ sm;
            if (k >= l) ++ sm;
            if (sm != lmt[i][p].y) { dp[i][j][k] = 0; break; }
        }
        if (!dp[i][j][k]) continue;
        if (i == n) ad(Ans, dp[i][j][k]);
        else {
            ad(dp[i + 1][j][k], dp[i][j][k]);
            ad(dp[i + 1][i][j], dp[i][j][k]);
            ad(dp[i + 1][i][k], dp[i][j][k]);
        }
    }
    printf("%d\n", Ans);

    return 0;
}
import cv2 import numpy as np def is_approx_rect(contour, epsilon_factor=0.02): peri = cv2.arcLength(contour, True) approx = cv2.approxPolyDP(contour, epsilon_factor * peri, True) return (4 <= len(approx) <= 5 and cv2.isContourConvex(approx)), approx def calc_center(approx): M = cv2.moments(approx) if M["m00"] == 0: return None return int(M["m10"] / M["m00"]), int(M["m01"] / M["m00"]) def distance(p1, p2): return np.sqrt((p1[0]-p2[0])**2 + (p1[1]-p2[1])**2) def main(): cap = cv2.VideoCapture("222.mp4") if not cap.isOpened(): print("打开视频失败") return prev_center = None while True: ret, frame = cap.read() if not ret: break gray = cv2.cvtColor(frame, cv2.COLOR_BGR2GRAY) _, binary = cv2.threshold(gray, 120, 255, cv2.THRESH_BINARY_INV) closed = cv2.morphologyEx(binary, cv2.MORPH_CLOSE, cv2.getStructuringElement(cv2.MORPH_RECT, (50, 50))) contours_data = cv2.findContours(closed, cv2.RETR_TREE, cv2.CHAIN_APPROX_SIMPLE) contours = contours_data[1] if len(contours_data) == 3 else contours_data[0] candidates = [] for cnt in contours: is_rect, approx = is_approx_rect(cnt) if is_rect: center = calc_center(approx) if center: candidates.append((approx, center, cv2.contourArea(approx))) if not candidates: selected = None elif prev_center is None: selected = max(candidates, key=lambda x: x[2]) else: candidates.sort(key=lambda x: distance(x[1], prev_center)) top_n = [candidates[0]] for c in candidates[1:]: if distance(c[1], prev_center) - distance(candidates[0][1], prev_center) < 50: top_n.append(c) else: break selected = max(top_n, key=lambda x: x[2]) display_frame 将上述代码改成适用于 openmv4 h7 plus 的代码要求给出完整代码
最新发布
08-03
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值