湖南集训 Day2

//前缀和 记录一下  枚举'0' '1' 的分界点
#include<iostream>
#include<cstring>
#include<cstdio>
#define MAXN 100005
using namespace std;
char s[MAXN];
int sum[MAXN];
int main(int argc,char *argv[]){
    freopen("reverse.in","r",stdin);
    freopen("reverse.out","w",stdout);
    scanf("%s",s+1);
    int Ans = 1E9, len = strlen(s + 1);
    for(int i=1; i<=len; ++i)
        sum[i] = sum[i-1] + (s[i] == '1');
    for(int i=0; i<=len; ++i)
        Ans = min(Ans, sum[i] + ( (len - i) - (sum[len] - sum[i]) ));
    printf("%d\n",Ans);
    fclose(stdin); fclose(stdout);
    return 0;
}

Hash 一下每个数的数码种类

//我们这边的机器跑得慢 但是题目给了足够的空间 开MAXN*10 每次不用memset
//也就不会T那么两三个点了
#include<iostream>
#include<cstring>
#include<cstdio>
#include<algorithm>
#define MAXN 10000005
using namespace std;
bool v[MAXN][10];
inline void read(int &x){
    x=0; register char c=getchar();
    while(c>'9'||c<'0') c=getchar();
    while(c>='0'&&c<='9'){ x=x*10+c-'0'; c=getchar(); }
}
int prime[10]={2,3,5,7,11,13,19,17,23,29};
int prim[10]={101,103,107,109,113,127,131,137,233,151};
int cnt[MAXN];
int main(int argc,char *argv[]){
    freopen("number.in","r",stdin);
    freopen("number.out","w",stdout);
    int n,x,p,Num; read(n);
    for(int i=1; i<=n; ++i) {
        x = i,Num = 0;
        while(x){
             p = x % 10;
             if(!v[i][p]) Num += prim[p] * prime[p] + p * prime[p];
             v[i][p] = true;
             x /= 10;
        }
        ++cnt[Num];
    }
    long long Ans = 0;
    for(int i=1; i<=1000000; ++i)
        if(cnt[i])
            Ans = Ans + ( (cnt[i] * (cnt[i] - 1) ) >> 1 );
    printf("%I64d\n",Ans);
    fclose(stdin); fclose(stdout);
    return 0;
}

//我的代码 由于每次memset T了两三个点  
#include<iostream>
#include<cstring>
#include<cstdio>

using namespace std;

inline void read(int &x){
    x=0; int f=1; char c=getchar();
    while(c>'9'||c<'0'){ if(c=='-')f=-1; c=getchar(); }
    while(c>='0'&&c<='9'){ x=x*10+c-'0'; c=getchar(); } x *= f;
}
bool v[15];
int f[500000];
//f[8] 表示各位数码上只有'3'的数字个数
//以此类推 f[10] 表示 表示各位数码上有'3'和'1'的数字个数 13\31
int main(int argc,char *argv[]){
    freopen("number.in","r",stdin);
    freopen("number.out","w",stdout);
    int n,x,Num; read(n);
    for(int i=1; i<=n; ++i){
        x = i,Num = 0;
        memset(v,0,sizeof v );
        while(x) v[x % 10] = 1,x /= 10;
        for(int j=0; j<=9; ++j)
            if(v[j]) Num += (1 << j);
        ++f[Num];
    }
    long long Ans = 0;
    for(int i=1; i<=(1 << 10); ++i)
        Ans = Ans + (1LL * f[i] * (f[i] - 1) * 0.5);
        //C(n,2) 任意找两个 数码种类相同的 肯定一个大一个小 应该对吧 
    printf("%I64d\n",Ans);
    fclose(stdin); fclose(stdout);
    return 0;
}

20分暴力DP

#include<iostream>
#include<cstdio>
#include<cstring>
#include<cstdlib>

#define N 1000007

using namespace std;
int dp[N],a[N],cnt[N];
inline void read(int &x){
    x=0; char c=getchar();
    while(c>'9'||c<'0') c=getchar();
    while(c>='0'&&c<='9'){ x=x*10+c-'0'; c=getchar(); }
}
int main() {
    freopen("wave.in","r",stdin);
    freopen("wave.out","w",stdout);
    int n,k,Ans; read(n),read(k);
    for(int i=1; i<=n; i++) read(a[i]);
    for(int i=1; i<=n; i++) dp[i]=cnt[i]=1;
    for(int i=2; i<=n; i++) 
        for(int j=1; j<=i; j++) 
            if(abs(a[j]-a[i])>=k) {
                if(!(cnt[j] & 1) && a[i] < a[j] && dp[i] < dp[j] + 1)
                    dp[i] = dp[j] + 1,cnt[i] = cnt[j] + 1;
                else if((cnt[j] & 1) && a[i] >= a[j] && dp[i] < dp[j] + 1)
                    dp[i] = dp[j] + 1,cnt[i] = cnt[j] + 1;
                else dp[i] = max(dp[i],dp[j]);
            }
    printf("%d\n",dp[n]);
    fclose(stdin); fclose(stdout);
    return 0;
}

正解：贪心，就是奇数项尽量小，偶数项尽量大

#include<iostream>
#include<cstring>
#include<cstdio>
#include<cmath>
#include<algorithm>
#define MAXN 2000005
using namespace std;
int a[MAXN];

inline void read(int &x){
    x=0; char c=getchar();
    while(c>'9'||c<'0') c=getchar();
    while(c>='0'&&c<='9'){ x=x*10+c-'0'; c=getchar(); }
}

int main(int argc,char *argv[]){
    freopen("wave.in","r",stdin);
    freopen("wave.out","w",stdout);
    int n, k; read(n),read(k);
    for(int i=1; i<=n; ++i) read(a[i]);
    int last = a[1], opt = 1, Ans = 1;
    for(int i=2; i<=n; ++i) {
        if(opt) {//ou
            if(abs(a[i] - last) >= k && a[i] >= last) last = a[i], opt ^= 1, ++Ans;
            else last = min(last,a[i]);
        }
        else {//ji
            if(abs(a[i] - last) >= k && a[i] <= last) last = a[i], opt ^= 1, ++Ans;
            else last = max(last,a[i]);
        }
    }
    printf("%d\n",Ans);
    fclose(stdin); fclose(stdout);
    return 0;
}