将本段代码转为c语言:```python n = int(input()) # 珠子数目 necklace = input() # 项链字符串 # 初始化dp数组 dp = [[0] * (2*n) for _ in range(2*n)] for i in range(2*n): dp[i][i] = 1 # 动态规划 for length in range(2, 2*n+1): for i in range(2*n - length + 1): j = i + length - 1 if necklace[i] == necklace[j]: dp[i][j] = dp[i+1][j-1] + 2 else: for k in range(i, j): dp[i][j] = max(dp[i][j], dp[i][k] + dp[k+1][j]) # 输出结果 print(dp[0][2*n-1]) ```

以下是转换后的C语言代码：

#include <stdio.h>
#include <string.h>

int main() {
    int n;
    scanf("%d", &n);  // 珠子数目
    char necklace[2*n+1];
    scanf("%s", necklace);  // 项链字符串
    int dp[2*n][2*n];
    memset(dp, 0, sizeof(dp));  // 初始化dp数组
    for (int i = 0; i < 2*n; i++) {
        dp[i][i] = 1;
    }
    // 动态规划
    for (int length = 2; length <= 2*n; length++) {
        for (int i = 0; i <= 2*n - length; i++) {
            int j = i + length - 1;
            if (necklace[i] == necklace[j]) {
                dp[i][j] = dp[i+1][j-1] + 2;
            } else {
                for (int k = i; k < j; k++) {
                    dp[i][j] = (dp[i][j] > dp[i][k] + dp[k+1][j]) ? dp[i][j] : dp[i][k] + dp[k+1][j];
                }
            }
        }
    }
    // 输出结果
    printf("%d\n", dp[0][2*n-1]);
    return 0;
}