新得了一道好题，请各位dalao指点指点
2024-06-02 13:14:44
发布于：北京
44阅读
0回复
0点赞
rt
好题
全部评论 10
cin >> n >> q >> k;
vector<int> products(n);
for (int i = 0; i < n; i++) {
cin >> products[i];
}2024-06-01 来自 浙江
0for (int i = 0; i < q; i++) {
int l, r, t;
cin >> l >> r >> t;
l -= 1;
r -= 1;2024-06-01 来自 浙江
0vector<int> current_positions(n);
for (int j = 0; j < n; j++) {
current_positions[j] = (j + t * k) % n;
}2024-06-01 来自 浙江
0vector<int> quality;
for (int j = 0; j < n; j++) {
if (current_positions[j] >= l && current_positions[j] <= r) {
quality.push_back(products[j]);
}2024-06-01 来自 浙江
0cout << *max_element(quality.begin(), quality.end()) - *min_element(quality.begin(), quality.end()) << endl;
}return 0;}
2024-06-01 来自 浙江
0
有帮助，赞一个