Dreamoon and MRT

Dreamoon and MRT

题目链接:

http://codeforces.com/group/gRkn7bDfsN/contest/212299/problem/B

只需要考虑相对位置，设a0位置为0
枚举
由于对称性，可以设第一步向右，这样总时间减少一半
递归的话省去了cnt部分，直接从O(N2^N-1)变成了O（2^N-1）
可以分析一下几个代码的优化过程

#include <bits/stdc++.h>
using namespace std;
int n, a[], b[], c, cnt, ans = ;
int main() {
    scanf("%d", &n);
    for (int i = ; i < n; i++)
        scanf("%d", &a[i]);
    for (int i = ; i < ( << n); i++) {
        int s = ;
        c++;
        cnt = ;
        b[] = s;
        for (int j = ; j < n; j++) {
            if (i >> j & ) s += a[j];
            else s -= a[j];
            b[j + ] = s;
        }
        sort(b, b + n + );
        ans = min(ans, (int)(unique(b, b + n + ) - b));
    }
    printf("%d\n", ans);
}

#include <bits/stdc++.h>
using namespace std;
int n, a[], b[], c, cnt, v[], ans = ;
int main() {
    scanf("%d", &n);
    for (int i = ; i < n; i++)
        scanf("%d", &a[i]);
    for (int i = ; i < ( << n); i++) {
        int s =  * ;
        c++;
        cnt = ;
        v[s] = c;
        for (int j = ; j < n; j++) {
            if (i >> j & ) s += a[j];
            else s -= a[j];
            if (v[s] != c) {
                cnt++;
                v[s] = c;
            }
        }
        ans=min(ans,cnt);
    }
    printf("%d\n", ans);
}

#include <bits/stdc++.h>
using namespace std;
int n, a[], b[], c, cnt, v[], ans = ;
int main() {
    scanf("%d", &n);
    for (int i = ; i < n; i++)
        scanf("%d", &a[i]);
    for (int i = ; i < ( << n); i+=) {
        int s =  * ;
        c++;
        cnt = ;
        v[s] = c;
        for (int j = ; j < n; j++) {
            if (i >> j & ) s += a[j];
            else s -= a[j];
            if (v[s] != c) {
                cnt++;
                v[s] = c;
            }
        }
        ans=min(ans,cnt);
    }
    printf("%d\n", ans);
}

#include <bits/stdc++.h>
using namespace std;
const int SIZE = 5e6+;
int m,cnt[SIZE],an,d[];
void dfs(int i,int x,int v){
    if(i==m){
        an=min(an,v);
        return;
    }
    int nxt=x+d[i];
    cnt[nxt]++;
    dfs(i+,nxt,v+(cnt[nxt]==));
    cnt[nxt]--;

    nxt=x-d[i];
    cnt[nxt]++;
    dfs(i+,nxt,v+(cnt[nxt]==));
    cnt[nxt]--;
}
int main(){
    scanf("%d",&m);
    an=m+;
    for(int i=;i<m;i++)
        scanf("%d",&d[i]);
    cnt[SIZE/]=;//
    cnt[SIZE/+d[]]=;//强制第一步向右
    dfs(,SIZE/+d[],);
    printf("%d\n",an);
    return ;
}