ACM-ICPC实验室20.2.22测试-动态规划

C.田忌赛马

直接贪心做就可以~

#include<bits/stdc++.h>
using namespace std;
const int maxn=;
int a[maxn],b[maxn];
int main() {
    int n;
    while(~scanf("%d",&n)) {
        for(int i=;i<n;i++) scanf("%d",&b[i]);
        for(int i=;i<n;i++) scanf("%d",&a[i]);
        sort(a,a+n);
        sort(b,b+n);
        int x1=,y1=;
        int x2=n-,y2=n-;
        int ans=;
        for (int i=;i<n;i++) {
            if (a[x1]>b[y1]) {
                ans+=;
                x1++;
                y1++;
            }
            else if(a[x1]<b[y1]) {
                ans-=;
                x1++;
                y2--;
            }
            else {
                if(a[x2]>b[y2]) {
                    ans+=;
                    x2--;
                    y2--;
                }
                else if (a[x1]<b[y2]) {
                    ans-=;
                    x1++;
                    y2--;
                }
            }
        }
        printf("%d\n",ans);
    }
    return ;
}

D.202020

最简单的dp~

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn=1e6+;
ll dp[maxn],dp1[maxn];
int main () {
    string s;
    cin>>s;
    if (s[]=='') dp[]=,dp1[]=;
    else dp[]=,dp1[]=;
    for (int i=;i<s.length();i++) {
           if (s[i]=='') dp[i]=dp1[i-],dp1[i]=dp[i-]+;
        else dp[i]=dp[i-]+,dp1[i]=dp1[i-];
    }
    ll ans=;
    for (int i=;i<s.length();i++) ans+=dp[i];
    printf ("%lld\n",ans);
    return ;
}
//2020