太戈编程 461,193,990,977

461。。。。。

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=1007,INF=1e6+7;
string t;
bool match(char a,char b){
    return a=='(' and b==')' or a=='[' and b==']' or a=='{' and b=='}';
}
ll f[N][N],n;
int main(){
//    freopen(".in","r",stdin);
//    freopen(".out","w",stdout);
    cin>>t;
    string s="";
    for(int i=0;i<t.size();i++) if(t[i]=='(' or t[i]==')' or t[i]=='[' or t[i]==']' or t[i]=='{' or t[i]=='}') s+=t[i];
    n=s.size();
    fill(f[0],f[0]+N*N,INF);
    for(int i=0;i<n;i++) f[i][i]=1;
    for(int i=0;i<n-1;i++){
        if(match(s[i],s[i+1])) f[i][i+1]=0;
        else f[i][i+1]=2;
    }
    for(int i=n-3;i>=0;i--){
        for(int j=i+2;j<=n-1;j++){
            for(int k=i;k<=j-1;k++) f[i][j]=min(f[i][k]+f[k+1][j],f[i][j]);
            if(match(s[i],s[j])) f[i][j]=min(f[i+1][j-1],f[i][j]);
        }
    }
    cout<<f[0][n-1];
    return 0;
}

193.。。。。。

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll N=107,INF=2e8;
int n,f[N][N],w[N],s[N];
int main(){
    freopen("merge.in","r",stdin);
    freopen("merge.out","w",stdout);
    cin>>n;
    for(int i=1;i<=n;i++) cin>>w[i];
    s[0]=0;
    fill(f[0],f[0]+N*N,INF);
    for(int i=1;i<=n;i++) s[i]=s[i-1]+w[i],f[i][i]=0;
    for(int i=n-1;i>=1;i--) for(int j=i+1;j<=n;j++) for(int k=i;k<=j-1;k++) f[i][j]=min(f[i][k]+f[k+1][j]+s[j]-s[i-1],f[i][j]);
    cout<<f[1][n];
    return 0;
}

990。。。。

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
    freopen("ladder.in", "r", stdin);
    freopen("ladder.out", "w", stdout);
    int n, x[400007], cnt[400007];
    cin >> n;
    for (int i = 1; i <= n; i++) {
        cin >> x[i];
        cnt[x[i]]++;
    }
    sort(x + 1, x + 1 + n);
    ll ans = 0;
    int p = 0;
    for (int i = 1; i <= n; i++) {
        if (x[i] == x[i - 1]) {
            p = max(p, x[i] + 1);
            while (cnt[p]) p++;
            ans += p - x[i];
            cnt[p++] = 1;
        }
    }
    cout << ans;
    return 0;
}

997。。。。

#include<bits/stdc++.h>
using namespace std;
int p,cnt=1,k,m,d[10009];
int main(){
    freopen("criminal3.in ","r",stdin);
    freopen("criminal3.out ","w",stdout);
    cin>>k>>m;
    for(int i=0;i<k;i++) cin>>d[i];
    sort(d,d+k);
    for(int i=1;i<k;i++)
        if(d[i]-d[p]>=m){
            cnt++;
            p=i;
        }
    cout<<cnt;
    return 0;
}