УРКОП 2011: D

#include <cstdio>
#include <iostream>
#include <algorithm>

#define N 42
#define M 102

using namespace std;

typedef unsigned char uc;

uc dp[N][N][M][M];

uc max(int a, uc b) {
    uc c = uc(a);
    return max(c, b);
}

int main() {
    int a, b;
    cin >> a >> b;

    for (int i = 0; i <= 40; i++)
        for (int j = 0; j <= 40; j++)
            if (i + j) {
                for (int k = i; k <= a; k++)
                    for (int l = j; l <= b; l++) {
                        if (i)
                            dp[i][j][k][l] = max(dp[i - 1][j][k - 1][l] + 1, dp[i][j][k][l]);
                        else {
                            if (k)
                                dp[i][j][k][l] = max(dp[i][j][k - 1][l] + 2, dp[i][j][k][l]);
                        }

                        int add = (i > 0 ? 2 : 1);

                        if (j)
                            dp[i][j][k][l] = max(dp[i][j - 1][k][l - 1] + add, dp[i][j][k][l]);
                        else {
                            if (l)
                                dp[i][j][k][l] = max(dp[i][j][k][l - 1] + 2, dp[i][j][k][l]);
                        }
                    }
            }

    cout << int(dp[40][40][a][b]);
    return 0;
}