贪心 2016.11.4

1、Codeforces 489B BerSU Ball

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <map>
#include <queue>
#include <stack>
#include <set>
#include <bitset>
#include <ctime>

using namespace std;

typedef long long ll;
typedef unsigned long long ull;

const ll mod = 1e9 + 7;
const int INF = 0x7fffffff;
const int maxn = 100 + 10;

int n, m;
int a[maxn], b[maxn];

int main()
{
#ifdef Floyd
    freopen("in.txt", "r", stdin);
#endif
    scanf("%d", &n);
    for (int i = 0; i < n; ++i) {
        scanf("%d", &a[i]);
    }
    scanf("%d", &m);
    for (int i = 0; i < m; ++i) {
        scanf("%d", &b[i]);
    }
    sort(a, a + n), sort(b, b + m);
    int ans = 0;
    for (int i = 0, j = 0; i < n && j < m; ++j) {
        while (i < n && a[i] + 1 < b[j]) {
            ++i;
        }
        if (i == n) {
            break;
        }
        if (a[i] >= b[j] - 1 && a[i] <= b[j] + 1) {
            ++ans, ++i;
        }
    }
    printf("%d\n", ans);
    return 0;
}

2、Codeforces 538B Quasi Binary

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <map>
#include <queue>
#include <stack>
#include <set>
#include <bitset>
#include <ctime>

using namespace std;

typedef long long ll;
typedef unsigned long long ull;

const ll mod = 1e9 + 7;
const int INF = 0x7fffffff;

int n, len;
char s[10];
char s_t[10];
int num;
vector<int> ans;

int main()
{
#ifdef Floyd
    freopen("in.txt", "r", stdin);
#endif
    scanf("%d", &n);
    while (n) {
        sprintf(s, "%d", n);
        len = strlen(s);
        bool flag = true;
        memset(s_t, '\0', sizeof(s_t));
        for (int i = 0; i < len; ++i) {
            if (s[i] - '0' > 1) {
                s_t[i] = '1';
                flag = false;
            } else {
                s_t[i] = '0';
            }
        }
        if (flag) {
            strcpy(s_t, s);
        }
        num = 0;
        for (int i = 0; i < len; ++i) {
            num = num * 10 + s_t[i] - '0';
        }
        ans.push_back(num);
        n -= num;
    }
    int Size = ans.size();
    printf("%d\n", Size);
    for (int i = 0; i < Size - 1; ++i) {
        cout << ans[i] << " ";
    }
    cout << ans[Size - 1] << endl;
    return 0;
}

3、Codeforces 550C Divisibility by Eight

解题思路：

能被 8 整除的数，百位、十位和个位所组成的三位数能被 8 整除

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <map>
#include <queue>
#include <stack>
#include <set>
#include <bitset>
#include <ctime>

using namespace std;

typedef long long ll;
typedef unsigned long long ull;

const ll mod = 1e9 + 7;
const int INF = 0x7fffffff;
const int maxn = 100 + 10;

char s[maxn];
bool flag = false;

int main()
{
#ifdef Floyd
    freopen("in.txt", "r", stdin);
#endif
    scanf("%s", s);
    int ans = 0;
    int len = strlen(s);
    for (int i = 0; i < len ; ++i) {
        if (s[i] == '0') {
            flag = true;
            break;
        }
    }
    if (flag) {
        printf("YES\n");
        printf("%d\n", ans);
    } else {
        int num1, num2, num3;
        for (int i = 0; i < len; ++i) {
            num1 = s[i] - '0';
            if (num1 % 8 == 0) {
                ans = num1, flag = true;
                break;
            }
            for (int j = i + 1; j < len; ++j) {
                num2 = num1 * 10 + s[j] - '0';
                if (num2 % 8 == 0) {
                    ans = num2, flag = true;
                    break;
                }
                for (int k = j + 1; k < len; ++k) {
                    num3 = num2 * 10 + s[k] - '0';
                    if (num3 % 8 == 0) {
                        ans = num3, flag = true;
                        break;
                    }
                }
            }
        }
        if (flag) {
            printf("YES\n");
            printf("%d\n", ans);
        } else {
            printf("NO\n");
        }
    }
    return 0;
}

4、Codeforces 545C Woodcutters

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <map>
#include <queue>
#include <stack>
#include <set>
#include <bitset>
#include <ctime>

using namespace std;

typedef long long ll;
typedef unsigned long long ull;

const ll mod = 1e9 + 7;
const int INF = 0x7fffffff;
const int maxn = 1e5 + 10;

int n;
int x[maxn], h[maxn], dp[maxn];

int main()
{
#ifdef Floyd
    freopen("in.txt", "r", stdin);
#endif
    scanf("%d", &n);
    x[0] = -INF, x[n + 1] = INF;
    for (int i = 1; i <= n; ++i) {
        scanf("%d %d", &x[i], &h[i]);
    }
    for (int i = 1; i <= n; ++i) {
        scanf("%d %d", &x[i], &h[i]);
        if (x[i] - h[i] > x[i - 1]) {
            dp[i] = dp[i - 1] + 1;
        } else if (x[i] + h[i] < x[i + 1]) {
            dp[i] = dp[i - 1] + 1;
            x[i] += h[i];
        } else {
            dp[i] = dp[i - 1];
        }
    }
    printf("%d\n", dp[n]);
    return 0;
}

5、Codeforces 725D Contest Balloons

参考：http://www.cnblogs.com/GraceSkyer/p/5991466.html

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <map>
#include <queue>
#include <stack>
#include <set>
#include <bitset>
#include <ctime>
#include <cctype>

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> Pair;

const int mod = 1e9 + 7;
const int INF = 0x7fffffff;
const int maxn = 3e5 + 10;

struct Node {
    ll t, w, key;
    bool operator < (const Node &a) const {
        return key > a.key;
    }
};

int n;
Node node[maxn];
priority_queue<Node> q;

bool cmp(Node a, Node b) {
    return a.t > b.t;
}

int main()
{
#ifdef __AiR_H
    freopen("in.txt", "r", stdin);
#endif // __AiR_H_
    scanf("%d", &n);
    for (int i = 0; i < n; ++i) {
        scanf("%lld %lld", &node[i].t, &node[i].w);
        node[i].key = node[i].w - node[i].t + 1;
    }
    sort(node + 1, node + n, cmp);
    int ans = n, ans_t = n, cur = n;
    for (int i = 1; i < n; ++i) {
        if (node[0].t >= node[i].t) {
            cur = i; ans = i; ans_t = i;
            break;
        }
        q.push(node[i]);
    }
    while (!q.empty()) {
        Node f = q.top(); q.pop();
        if (node[0].t < f.key) {
            break;
        }
        node[0].t -= f.key;
        int t = 0;
        for (int i = cur; i < n; ++i) {
            if (node[0].t < node[i].t) {
                q.push(node[i]); ++t; ++cur;
            } else {
                break;
            }
        }
        ans_t = ans_t - 1 + t;
        ans = min(ans, ans_t);
    }
    printf("%d\n", ans);
    return 0;
}