|
发表于 2023-7-17 17:21:19
|
显示全部楼层
- #include <iostream>
- #include <algorithm>
- using namespace std;
- struct node{
- int x;
- int id;
- }a[8010];
- int t[8010];
- bool comp(node a, node b) {
- return a.x < b.x || (a.x == b.x && a.id < b.id);
- }
- int main(){
- int n, q;
- cin >> n >> q;
- for (int i = 1; i <= n; i++){
- cin >> a[i].x;
- a[i].id = i;
- }
- sort(a+1, a+n+1, comp);
- for (int i = 1; i <= n; i++){
- t[a[i].id] = i;
- }
- for (int i = 1; i <= q; i++){
- int c;
- cin >> c;
- if (c == 1){
- int x, v;
- cin >> x >> v;
- a[t[x]].x = v;
- sort(a+1, a+n+1, comp);
- for (int j = 1; j <= n; j++){
- t[a[j].id] = j;
- }
- }
- if (c == 2){
- int x;
- cin >> x;
- cout << t[x] << endl;
- }
- }
- return 0;
- }
复制代码
答案不会错,但是TLE了
76分 |
评分
-
参与人数 1 | 荣誉 -1 |
鱼币 -1 |
收起
理由
|
陈尚涵
| -1 |
-1 |
多说了别发题解,更何况你还没ac,先不扣贡. |
查看全部评分
|