SDNU_ACM_ICPC_2017_Winter_Practice_5th

A题爬楼梯，递归，签到题吧= =

B题动规

/*********************
author : MengXiangCong
*********************/
#include <cstdio>
#include <iostream>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <vector>
#include <map>
#include <queue>
#include <stack>

#define MAXX(a, b) a > b ? a : b
#define inf (1<<30)
#define eps 1e-6
#define PI acos(-1)
#define SET(a, b)  memset(a, b, sizeof(a))
using namespace std;

typedef long long LL;
int main()
{
    int n;
    int data[100 + 5][100 + 5];
    int f[100 + 5][100 + 5];
    while(scanf("%d", &n) != EOF)
    {
        int ans = 0;
        SET(data, 0);
        SET(f, 0);
        for(int q = 1; q <= n; ++q)
            for(int w = 1; w <= q; ++w)
            {
                scanf("%d", &data[q][w]);
            }
        for(int q = 1; q <= n; ++q)
        {
            for(int w = 1; w <= q; ++w)
            {
                if(q == 1)
                    f[q][w] = data[q][w];
                else if(w == 1)
                    f[q][w] = f[q - 1][w] + data[q][w];
                else if(w == q)
                    f[q][w] = f[q - 1][w - 1] + data[q][w];
                else
                    f[q][w] = max(f[q - 1][w - 1], f[q - 1][w]) + data[q][w];
            }
        }
        for(int q = 1; q < n; ++q)
            ans = max(ans, f[n][q]);
        cout << ans << endl;
    }
    return 0;
}

就因为用了MAXX的宏和max函数的区别，就是WA和AC的差距QAQ，改了半天，尝试了一下把宏改成max，就对了……就很气

C题同样递归

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

int dp[11][100001];

inline int Max(int a, int b, int c=-1)
{
    if(a < b) a = b;
    if(a < c) a = c;
    return a;
}

int main()
{
    int n, i, j;
    int t, x;
    while (scanf("%d", &n)!=EOF && n)
    {
        memset(dp, 0, sizeof(dp));
        int MaxTime = 0;
        for (i=0; i<n; ++i)
        {
            scanf("%d%d", &x, &t);
            ++dp[x][t];
            MaxTime = t>MaxTime ? t:MaxTime;
        }
        for (j=MaxTime-1; j>=0; --j)
        {
            dp[0][j] += Max(dp[0][j+1], dp[1][j+1]);
            dp[10][j] += Max(dp[10][j+1], dp[9][j+1]);
            for (i=1; i<10; ++i)
            {
                dp[i][j] += Max(dp[i][j+1], dp[i+1][j+1], dp[i-1][j+1]);
            }
        }
        printf("%d/n", dp[5][0]);
    }
    return 0;
}