题目来源
题目描述
题目解析
思路:
(1)将输入处理成一个int数组
(2)根据int数组生成一个区间:{{起始区间,结束区间}, {起始区间,结束区间}…}
(3)合并区间
(4)找哪些区间未被覆盖
实现
#include <iostream>
#include <utility>
#include <vector>
#include <random>
#include <iterator>
#include <map>
#include <algorithm>
#include <set>
#include <bitset>
#include <iostream>
using namespace std;
std::vector<std::vector<int>> generateRange(std::vector<int> &nums){
int N = nums.size();
// 生成区间
std::vector<std::vector<int>> range;
for (int i = 0; i < N; ++i) {
int loc = i * 100;
if(i == 0){
range.push_back({loc, std::min(loc + nums[i], (N - 1) * 100)});
}else if(i == N - 1){
range.push_back({std::max(0, loc - nums[i]), loc});
}else{
range.push_back({std::max(0, loc - nums[i]), std::min(loc + nums[i], (N - 1) * 100)});
}
}
return range;
}
std::vector<std::vector<int>> mergeRange(std::vector<std::vector<int>> &range){
std::vector<std::vector<int>> newRange;
std::sort(range.begin(), range.end(), [](const std::vector<int> &a, const std::vector<int> &b){
return a[0] < b[0] ? true : a[0] == b[0] ? a[1] < b[1] : false ;
});
newRange.push_back({range[0][0], range[0][1]});
for (int i = 1; i < range.size(); ++i) {
if(range[i][0] > newRange.back()[1]){
newRange.push_back({range[i][0], range[i][1]});
}else{
newRange.back()[1] = range[i][1];
}
}
return newRange;
}
int process(std::vector<int> &nums){
int N = nums.size();
if(N <= 1){
return 0;
}
auto range = generateRange(nums);
auto newRange = mergeRange(range);
int notLight = 0;
for (int i = 1; i < newRange.size(); ++i) {
notLight += newRange[i][0] - newRange[i - 1][1];
}
return notLight;
}
#include <sstream>
int main(){
while (true){
int N ;
std::cin >> N;
std::vector<int> arr(N);
for (int i = 0; i < N; ++i) {
std::cin >> arr[i];
}
int notLight = process(arr);
std::cout << notLight << "\n";
}
}