execution优化|贪心|区间问题

lc2589

#include <execution> // 头文件中包含 std::execution
class Solution {
public:
int findMinimumTime(vector<vector<int>>& tasks) {
sort(tasks.begin(), tasks.end(), [](auto& a, auto& b) {
return a[1] < b[1];
});
vector<bool> run(tasks.back()[1] + 1);
int ans = 0;
for (auto& v : tasks)
{
int start = v[0];
int end = v[1];
int dura = v[2];
int d= dura-std::reduce(std::execution::par, run.begin()+start, run.begin()+ end+1, 0);
for (int i = end; d > 0; i--)
{
if (run[i]) continue;
run[i] = true;
ans++;
d--;
}
}
return ans;
}
};