华为OD机试-路灯照明问题

#include<iostream>
#include<vector>
#include<algorithm>

using namespace std;

struct shadow
{
    int left;
    int right;
};

int main()
{
    int n, r;
    cin >> n;//路灯个数

    vector<shadow> list;
    vector<int> light;
    int i = 0, N = n;

    int maxRight = 0;
    for (int i = 0; i < n; ++i)
    {
        cin >> r;
        light.emplace_back(r);

        if (i == 0)
        {
            maxRight = r;
            continue;
        }

        int pos = i * 100;
        // 左边
        int left = pos - r;
        if (left > maxRight)
        {
            list.push_back({ maxRight, left });
        }

        int right = pos + r;
        if (right > maxRight)
        {
            maxRight = right;
        }

        for (auto it = list.begin(); it != list.end(); )
        {
            if (left < it->left)
            {
                it = list.erase(it);
                continue;
            }

            if (left < it->right)
            {
                it->right = left;
            }

            ++it;
        }
    }

    int area = 0;
    for (auto x : list)
    {
        area += x.right - x.left;
    }

    cout << area;

    return 0;
}