浙江十套 - 第二套 - 结题报告

1.倒水
不难发现这道题和二进制有某种关系，如果最终合并成k升水，则会用k的二进制下1的个数个杯子。于是进行贪心。。

#include <cstdio>
#include <iostream>
using namespace std;
int N, K;

int main() {
    freopen("water.in","r",stdin);
    freopen("water.out","w",stdout);
    cin >> N >> K;
    int base;
    for (int i = 1; i <= K; ++ i) {
        base = 1;
        for (; (base << 1) <= N; base <<= 1);
        N -= base;
        if (N <= 0) break;
    }
    int ans = base - N; 
    if (K == 0) cout << 0;
    else if (N > 0) cout << ans;
    else cout << 0;
    return 0;
}

2.单词缩写
一道按位DP的题。
此题还是很有难度的。。。。
先暴力去掉所有的单词，只对有效单词进行计算。

dp[i][j]表示前i个单词使用了前j个大写字母的方案数
初始条件dp[0][0]=1
转移：若第i个单词使用第j到第j+k个大写字母的方案数为temp[k]
则dp[i][j+k]=dp[i-1][j-1]*temp[k]
最终ans=dp[n][m]

#include<cstdio>
#include<iostream>
#include<cstring>
#include<algorithm>
using namespace std;
char w[101][150];
char s[150],let[150];
char over[9]= {'L','A','S','T',' ','C','A','S','E'};
struct word {
    char c[150];
    int l;
} a[150];
int t,n,m,len;
int dp[100][150],temp[150];

bool check() {
    for (int i=0; i<=8; ++ i)
        if (s[i] != over[i]) return false;
    return true;
}

inline void pre() {
    memset(dp,0,sizeof(dp));
    dp[0][0] = 1;
    memset(temp,0,sizeof(temp));
    memset(s,0,sizeof(s));
}

inline void DP() {
    for (int i = 1; i <= n; ++ i)
        for (int j = i; j <= i + m - n; ++ j) {
            memset(temp, 0, sizeof(temp));
            for (int p = 0; p <a[i].l; ++ p)
                for (int k = min(i + m - n - j, p); k >= 0; -- k) 
                    if (let[j+k] == a[i].c[p])
                        if (k) temp[k] += temp[k-1];
                        else temp[k] ++;
            for (int k = i + m - n - j; k >= 0; k--)
                dp[i][j+k] += dp[i-1][j-1] * temp[k];
        }
    if (dp[n][m]) printf(" can be formed in %d ways\n",dp[n][m]);
    else printf(" is not a valid abbreviation\n");
}
int main() {
    freopen("abbr.in","r",stdin);
    freopen("abbr.out","w",stdout);
    cin >> t;
    for (int i=1; i <= t; ++ i)
        cin >> w[i];

    while (1) {
        pre();
        char ch = getchar();
        len = 0;
        while ( !((ch >= 'a' && ch <= 'z') || (ch >= 'A' && ch <= 'Z')) ) ch = getchar();
        while ( (ch>='a'&&ch<='z') || (ch>='A'&&ch<='Z') || ch==' ' ) s[len ++] = ch, ch = getchar();
        n = m = 0;
        if (check()) break;
        int p = 0;
        for (int i = 1; i < 150; ++ i)
            memset(a[i].c, 0, sizeof(a[i].c)), a[i].l = 0;
        while (s[p] >= 'A' && s[p] <= 'Z') {
            printf("%c",s[p]);
            let [++m] = s[p] + 32;      //大小写转换
            p ++;
        }
        p ++;                           //起始位置
        while ( p < len) {
            n ++ ;
            while (s[p] >= 'a' && s[p] <= 'z') {
                a[n].c[a[n].l++] = s[p];
                p ++;
            }
            //判定无效
            for (int i = 1; i <= t; ++ i)
                if (strcmp(w[i], a[n].c) == 0) {
                    memset(a[n].c, 0, sizeof(a[n].c));
                    a[n].l = 0;
                    n--;
                    break;
                }
            p ++;
        }
        DP();
    }
    return 0;
}

3.求和
题目少打了个省略号，导致我一直没有过。
60分代码：

4.象棋比赛
贪心

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
const int maxn = 100010;
int n,k;
int level[maxn];
int val[maxn];

using namespace std;

int main() {
    freopen("chess.in","r",stdin);
    freopen("chess.out","w",stdout);
    cin >> n >> k;
    for (int i = 1; i <= n; ++ i) {
        cin >> level[i];
    }
    sort(level + 1, level + n + 1);
    for (int i = 1; i < n; ++ i) {
        val[i] = level[i + 1] - level[i];
    }
    sort(val + 1,val + n);
    int ans = 0;
    for(int i = 1; i <= k; ++ i) {
        ans += val[i];
    }
    cout << ans << endl;
}