BestCoder Round #58 (div.2) HDOJ5494 5495 5496 5497题解

题目连接: 点击打开链接

A: 模拟题, 从小到大排序后求a的前m个和与b的后m个和作比较即可.

AC代码:

#include "iostream"
#include "cstdio"
#include "cstring"
#include "algorithm"
using namespace std;
const int MAXN = 505;
int n, m, a[MAXN], b[MAXN];
int main(int argc, char const *argv[])
{
    int t;
    scanf("%d", &t);
    while(t--) {
        scanf("%d%d", &n, &m);
        for(int i = 0; i < n; ++i)
            scanf("%d", &a[i]);
        for(int i = 0; i < n; ++i)
            scanf("%d", &b[i]);
        sort(a, a + n);
        sort(b, b + n);
        int sum_a = 0, sum_b = 0;
        for(int i = 0; i < m; ++i)
            sum_a += a[i];
        for(int i = n - 1; m > 0; --i, --m)
            sum_b += b[i];
        if(sum_a > sum_b) printf("YES\n");
        else printf("NO\n");
    }
    return 0;
}

B: 脑洞题, 把排列分成若干个环, 每个环拿出一个元素即可构成最长公共子序列, 答案即为n减去环的个数.

AC代码:

#include "iostream"
#include "cstdio"
#include "cstring"
#include "algorithm"
using namespace std;
const int MAXN = 1e5 + 5;
int n, a[MAXN], b[MAXN], magic_a[MAXN], magic_b[MAXN];
bool vis[MAXN];
int main(int argc, char const *argv[])
{
    int t;
    scanf("%d", &t);
    while(t--) {
        memset(vis, false, sizeof(vis));
        scanf("%d", &n);
        for(int i = 0; i < n; ++i) {
            scanf("%d", &a[i]);
            magic_a[a[i]] = i;
        }
        for(int i = 0; i < n; ++i) {
            scanf("%d", &b[i]);
            magic_b[b[i]] = i;
        }
        int ans = 0;
        for(int i = 0; i < n; ++i) {
            if(!vis[i]) {
                int x = i, len = 0;
                while(!vis[x]) {
                    len++;
                    vis[x] = true;
                    x = magic_b[a[x]];
                }
                if(len > 1) ans++;
            }
        }
        printf("%d\n", n - ans);
    }
    return 0;
}

C: 脑洞题, 子序列数目有很多, 考虑每一个元素的贡献价值, 对当前数a[i]进行分析, i后有2^(n - i)种选择, a[i]前面的i出现位置记录为a, b, 

c..减去2^(a - 1), 2^(b - 1), 2^(c - 1)..即可.

AC代码:

#include "iostream"
#include "cstdio"
#include "cstring"
#include "algorithm"
#include "map"
using namespace std;
typedef long long ll;
const int MAXN = 1e5 + 5;
const int MOD = 1e9 + 7;
int n;
ll a[MAXN], tim[MAXN];
map<int, int> mp;
ll power_mod(ll a, ll b, int c)
{
    ll ans = 1;
    a %= c;
    while(b > 0) {
        if(b & 1) ans = (ans * a) % c;
        b >>= 1;
        a = (a * a) % c;
    }
    return ans;
}
ll mul(ll x)
{
    return power_mod(2, x, MOD);
}
int main(int argc, char const *argv[])
{
    int t;
    scanf("%d", &t);
    while(t--) {
        mp.clear();
        memset(tim, 0, sizeof(tim));
        scanf("%d", &n);
        for(int i = 1; i <= n; ++i)
            scanf("%lld", &a[i]);
        ll ans = 0;
        for(int i = 1; i <= n; ++i) {
            if(!mp.count(a[i])) ans = (ans + a[i] * mul(n - 1)) % MOD;
            else ans = (ans + a[i] * (mul(i - 1) - mp[a[i]]) % MOD * mul(n - i) % MOD) % MOD;
            mp[a[i]] = (mp[a[i]] + mul(i - 1)) % MOD;
        }
        printf("%lld\n", (ans + MOD) % MOD);
    }
    return 0;
}

D: 树状数组应用, 对一个长度为L的连续子序列, 删掉之后逆序减少的个数是这段区间a[i]之前比a[i]大的数之和 + 这段区间a[i]之后比a[i]

小的数之和 - 此区间逆序数的个数, 这三个数均用树状数组来求, c数组记录前者, b数组记录后者.

AC代码:

#include "iostream"
#include "cstdio"
#include "cstring"
#include "algorithm"
using namespace std;
const int MAXN = 1e5 + 5;
typedef long long ll;
int n, m, a[MAXN], b[MAXN], c[MAXN];
int lowbit(int x)
{
    return x & (-x);
}
void update(int *x, int i, int v)
{
    while(i <= n) {
        x[i] += v;
        i += lowbit(i);
    }
}
int query(int *x, int i)
{
    int sum = 0;
    while(i > 0) {
        sum += x[i];
        i -= lowbit(i);
    }
    return sum;
}
int main(int argc, char const *argv[])
{
    int t;
    scanf("%d", &t);
    while(t--) {
        memset(b, 0, sizeof(b));
        memset(c, 0, sizeof(c));
        scanf("%d%d", &n, &m);
        for(int i = 1; i <= n; ++i)
            scanf("%d", &a[i]);
        ll tmp = 0;
        for(int i = n; i > m; --i) {
            tmp += query(c, a[i] - 1);
            update(c, a[i], 1);
        }
        ll ans = tmp;
        for(int i = m + 1; i <= n; ++i) {
            tmp -= query(c, a[i] - 1);
            tmp -= query(b, n) - query(b, a[i]);
            update(c, a[i], -1);
            tmp += query(c, a[i- m] - 1);
            tmp += query(b, n) - query(b, a[i - m]);
            update(b, a[i - m], 1);
            ans = min(ans, tmp);
        }
        printf("%lld\n", ans);
    }
    return 0;
}