求hack
查看原帖
求hack
1127667
_Icetihw_楼主2024/1/29 10:56
#include<bits/stdc++.h>
#define ll long long
using namespace std;
ll n,a[3001000];
ll dp,d,ans = 0;
unordered_map<ll,bool> vis;
unordered_map<ll,ll> m;
stack<ll> st;
string s;
int main(){
    ios::sync_with_stdio(0);
    cin.tie(0);cout.tie(0);
    srand(time(NULL));
    cin>>n;
    cin>>s;s = '#' + s;
    for(int i=1;i<=n;i++) cin>>a[i];
    m[0] = -1 * a[1];
    for(int i=1;i<=n;i++){
        d = rand();
        if(s[i] == '('){
            st.push(d);
            ans += d;
        }
        else if(st.size() != 0){
            ans -= st.top();
            st.pop();
        }
        else ans += d;
        if(vis[ans] == 0 && ans != 0) m[ans] = -1e8;
        dp = max(dp,m[ans] + a[i]);
        m[ans] = max(m[ans],dp - a[i+1]);
        vis[ans]= 1;
    }
    cout<<dp;
    return 0;
}

前面全wa
后面三个点t
但本地测的都对了,求调thx

2024/1/29 10:56
加载中...