比赛-NOIP2015 普及组复赛 (Nov, 2016)

先贴上代码，迟一些会附上文字讲解。

#include <cstdio>
int k, ans;

int main()
{
    freopen("coin.in", "r", stdin);
    freopen("coin.out", "w", stdout);
    
    int day = 0, i = 0;
    scanf("%d", &k);
    do {
        if ((day += ++i) > k) {
            ans -= (day - k - i) * i;
            break;
        }
        ans += i * i;
    } while (true);
    
    printf("%d
", ans);
    
    fclose(stdin);
    fclose(stdout);
    
    return 0;
}

#include <cstdio>

const int MAX_N = 105, MAX_M = 105;

int n, m;
int nxt[8][2] = {{0, 1}, {0, -1}, {1, 0}, {-1, 0}, 
                {-1, 1}, {-1, -1}, {1, 1}, {1, -1}};
bool G[MAX_N][MAX_M];

void input()
{
    int i, j;
    char tt;
    scanf("%d%d", &n, &m);
    for (i = 1; i <= n; ++i)
        for (j = 1; j <= m; ++j) {
            while ((tt = getchar()) == '
' || tt == ' ');
            G[i][j] = tt == '*';
        }
    return ;
}

void solve()
{
    int i, j, k, ans;
    for (i = 1; i <= n; ++i) {
        for (j = 1; j <= m; ++j) {
            if (G[i][j]) {
                putchar('*');
                continue;
            }
            ans = 0;
            for (k = 0; k < 8; ++k)
                ans += G[i + nxt[k][0]][j + nxt[k][1]];
            printf("%d", ans);
        }
        putchar('
');
    }
    return ;
}

int main()
{
    freopen("mine.in", "r", stdin);
    freopen("mine.out", "w", stdout);
    
    input();
    solve();
    
    fclose(stdin);
    fclose(stdout);
    return 0;
}

#include <cstdio>

const int MAX_NM = 100005, MOD = 10007;

int n, m, ans;
int N[MAX_NM], C[MAX_NM];
int k[2][MAX_NM], sum[2][MAX_NM];

inline void getnum(int &num)
{
    char tt;
    bool flag = false;
    while (((tt = getchar()) < '0' || tt > '9') && tt != '-');
    if (tt == '-') {
        flag = true;
        num = 0;
    }
    else {
        num = tt - '0';
    }
    while ((tt = getchar()) >= '0' && tt <= '9')
        num = num * 10 + tt - '0';
    if (flag)
        num = -num;
    return ;
}

inline void add_mod(int &a, int b)
{
    a = (a + b % MOD) % MOD;
    return ;
}

int main()
{
    freopen("sum.in", "r", stdin);
    freopen("sum.out", "w", stdout);
    
    int i, tmp;
    getnum(n);
    getnum(m);
    for (i = 1; i <= n; ++i) {
        getnum(N[i]);
        N[i] %= MOD;
    }
    for (i = 1; i <= n; ++i) {
        getnum(C[i]);
        add_mod(k[i & 1][C[i]], 1);
        add_mod(sum[i & 1][C[i]], N[i]);
    }
    for (i = 1; i <= n; ++i)
        add_mod(ans, i % MOD * (N[i] * (k[i & 1][C[i]] - 2) % MOD + sum[i & 1][C[i]]) % MOD);
    
    printf("%d
", ans);
    
    fclose(stdin);
    fclose(stdout);
    
    return 0;
}

#include <cstdio>
#include <algorithm>
using namespace std;

const int MAX_N = 100005;

int n, ans, top_l;
int S[MAX_N], A[MAX_N];
int l[MAX_N];//max heap
char s[25];

struct house {
    int num;
    int w;
} W[MAX_N];


inline void getnum(int &num)
{
    char tt;
    bool flag = false;
    while (((tt = getchar()) < '0' || tt > '9') && tt != '-');
    if (tt == '-') {
        flag = true;
        num = 0;
    }
    else {
        num = tt - '0';
    }
    while ((tt = getchar()) >= '0' && tt <= '9')
        num = num * 10 + tt - '0';
    if (flag)
        num = -num;
    return ;
}

void putnum(int num)
{
    int top = 0;
    if (num < 0) {
        putchar('-');
        num = -num;
    }
    do
        s[++top] = num % 10 + '0';
    while (num /= 10);
    while (top)
        putchar(s[top--]);
    putchar('
');
    return ;
}

bool my_cmp(struct house a, struct house b)
{
    return a.w > b.w;
}

void shift_up(int k, int *heap, int top)
{
    int dad = k >> 1, tmp = heap[k];
    while (dad >= 1) {
        if (tmp > heap[dad]) {
            heap[k] = heap[dad];
            k = dad;
            dad >>= 1;
        } else {
            break;
        }
    }
    heap[k] = tmp;
    return ;
}

void shift_dn(int k, int *heap, int top)
{
    int son = k << 1, tmp = heap[k];
    while (son <= top) {
        if (son < top && heap[son] < heap[son + 1])
            ++son;
        if (tmp < heap[son]) {
            heap[k] = heap[son];
            k = son;
            son <<= 1;
        } else {
            break;
        }
    }
    heap[k] = tmp;
    return ;
}

int main()
{
    freopen("salesman.in", "r", stdin);
    freopen("salesman.out", "w", stdout);
    
    
    int i, x, dis = 0, p = 1;
    bool flag = false;
    
    getnum(n);
    for (i = 1; i <= n; ++i)
        getnum(S[i]);
    for (i = 1; i <= n; ++i) {
        getnum(A[i]);
        W[i].w = A[i] + (S[i] << 1);
        W[i].num = i;
    }
    
    sort(W + 1, W + n + 1, my_cmp);
    
    for (x = 1; x <= n; ++x) {
        int tmp;
        if (p > n || (top_l && l[1] > W[p].w - (S[dis] << 1))) {
            ans += l[1];
            l[1] = l[top_l];
            shift_dn(1, l, --top_l);
        } else {
            ans += W[p].w - (S[dis] << 1);
            dis = W[p].num;
            while (++p <= n && S[W[p].num] < S[dis]) {
                l[++top_l] = A[W[p].num];
                shift_up(top_l, l, top_l);
            }
        }
        putnum(ans);
    }
    
    fclose(stdin);
    fclose(stdout);
    return 0;
}