编号 题目 状态 分数 总时间 内存 代码 / 答案文件 提交者 提交时间
#4698 #1024. 冒险之路 Compile Error 0 0 ms 0 K C++ 17 (Clang) / 1.4 K s230026023 2024-01-17 15:50:28
显示原始代码
#include <iostream>
#include <vector>
#include <algorithm>
#include <stdio.h>
#include <math.h>
#include <cstdio>
#include <cstring>
#define maxn 2005

using namespace std;
struct guai_wu {
    int a;
    int b;
};
bool cmp(guai_wu g1, guai_wu g2) { return g1.a < g2.a; }
int main() {
    int n;
    cin >> n;
    guai_wu g[n + 1];
    for (int i = 1; i <= n; i++) {
        cin >> g[i].a;
    }
    int b[n + 1];
    for (int i = 1; i <= n; i++) {
        cin >> g[i].b;
    }
    int m;
    cin >> m;
    sort(g + 1, g + n + 1, cmp);
    int need = g[1].a;
    int sum_b = 0;
    for (int i = 1; i < n; i++) {
        // cout<<g[i].a<<" "<<g[i].b<<endl;
        sum_b = g[i].b + sum_b;
        //	cout<<sum_b<<" ";
        if ((g[i].a + g[i].b) <= g[i + 1].a) {
            if (g[i + 1].a - sum_b > need) {
                need = g[i + 1].a - sum_b + 1;
                //		cout<<sum_b<<endl;
                //		cout<<need<<endl;
            }
        }
    }
    // cout<<need<<endl;
    int ys[m + 1];
    for (int i = 1; i <= m; i++) {
        cin >> ys[i];
    }
    int time[m + 1] = { 0 };
    int power[maxn] = { 0 };

    for (int i = 1; i <= maxn; i++) {
        for (int j = 1; j <= i; j++) {
            power[i] = min(j, i - j + 1) + power[i];
        }
        // cout<<power[i]<<endl;
    }
    for (int i = 1; i <= m; i++) {
        for (int j = 0; j <= maxn; j++) {
            if (ys[i] + power[j] >= need) {
                // cout<<need<<" "<<ys[i]<<endl;
                // cout<<power[j]<<endl;
                time[i] = j;
                // cout<<j<<endl;

                break;
            }
        }
    }
    for (int i = 1; i < m; i++) {
        cout << time[i] << " ";
    }
    cout << time[m] << endl;
    return 0;
}

编译信息

/sandbox/1/a.cpp:59:11: error: variable-sized object may not be initialized
        int time[m+1]={0};
                 ^~~
1 error generated.