From 84eee83148c1abd65dfff0e67636e6dfd7801343 Mon Sep 17 00:00:00 2001 From: Zengtudor Date: Thu, 28 Aug 2025 21:23:39 +0800 Subject: [PATCH] =?UTF-8?q?feat(P4342):=20=E5=AE=9E=E7=8E=B0=E5=8A=A8?= =?UTF-8?q?=E6=80=81=E8=A7=84=E5=88=92=E7=AE=97=E6=B3=95=E8=A7=A3=E5=86=B3?= =?UTF-8?q?=E7=8E=AF=E5=BD=A2=E8=A1=A8=E8=BE=BE=E5=BC=8F=E9=97=AE=E9=A2=98?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit 添加动态规划表初始化及输入处理逻辑 包括同步IO优化和环形操作符数组处理 --- src/8/28/P4342.cpp | 38 +++++++++++++++++++++++++++++++++++++- 1 file changed, 37 insertions(+), 1 deletion(-) diff --git a/src/8/28/P4342.cpp b/src/8/28/P4342.cpp index 28170a4..4c2433e 100644 --- a/src/8/28/P4342.cpp +++ b/src/8/28/P4342.cpp @@ -24,8 +24,44 @@ dpmin[i][j] = 1e9 dp[i][i]=arr[i] */ - +#include +#include +#include +#include +using ll = int64_t; int main(){ + std::iostream::sync_with_stdio(false); + std::cin.tie(nullptr); + ll n; + std::cin>>n; + const ll add=0,mul=1; + const ll n21=2*n+1; + std::vector> op(n*2+1,std::vector(2)); + for(ll i=1;i<=n;i++){ + char c; + std::cin>>c; + if(c=='t'){ + op[i][0]=add; + }else{ + op[i][0]=mul; + } + std::cin>>op[i][1]; + op[i+n]=op[i]; + } + std::vector> dpmax,dpmin; + for(ll s=1;s(n21,-1e9)); + dpmin.clear(); + dpmin.resize(n21,std::vector(n21,1e9)); + for(ll i=s;i<=e;i++){ + dpmax[i][i]=op[i][1]; + } + for(ll i=s;i<=e;i++){ + + } + } } \ No newline at end of file