@[JiYumo](/user/1011137) 打一下注释吧
by PVZ__2 @ 2023-07-28 09:59:03
@[PVZ__2](/user/970447) ok
by Pitiless_boy @ 2023-07-28 10:00:50
```
#include<bits/stdc++.h>
using namespace std;
int n, m, T, ans;
int a[10001][10001], b[1000001][2], l;
int main(){
scanf("%d%d", &n, &m);
for (int i = 1; i <= n; i++)
for (int j = 1; j <= m; j++)
scanf("%d", &a[i][j]);
scanf("%d", &T);
for (int i = 1; i <= T; i++){//地理变迁
int x1, y, x2, y2;
scanf("%d%d%d%d", &x1, &y, &x2, &y2);
swap(a[x1][y], a[x2][y2]);//交换海拔
}
for (int i = 1; i <= n; i++)
for (int j = 1; j <= m; j++)
if (a[i][j] > 2)
ans++, b[++l][0] = i, b[l][1] = j;//求几座山峰和山峰坐标
printf("%d\n", ans);
for (int i = 1; i <= l; i++) {
for (int j = 0; j <= 1; j++)
printf("%d ", b[i][j]);//输出
printf("\n");
}
}
```
@[PVZ__2](/user/970447)
by Pitiless_boy @ 2023-07-28 10:04:05
@[JiYumo](/user/1011137)
```cpp
#include<bits/stdc++.h>
using namespace std;
int a[1007][1007],c[1000007],d[1000007];
int main(){
int n, m, p;
cin >> n >> m;
for (int i = 0; i <= n + 1; i++){
for (int j = 0; j <= m + 1; j++)a[i][j] = 0;
}
for (int i = 1; i <= n; i++){
for (int j = 1; j <= m; j++){
cin >> p;
a[i][j] = p;
}
}
int t;
int x1, y1, x2, y2;
cin >> t;
for (int i = 1; i <= t; i++){
cin >> x1 >> y1 >> x2 >> y2;
p = a[x1][y1];
a[x1][y1] = a[x2][y2];
a[x2][y2] = p;
}
int count = 0;
int k = 0;
for (int i = 1; i <= n; i++){//判断山峰
for (int j = 1; j <= m; j++){
if (a[i][j] > a[i - 1][j] && a[i][j] > a[i + 1][j] && a[i][j] > a[i][j - 1] && a[i][j] > a[i][j + 1]){
c[count] = i;
d[count] = j;
count++;
}
}
}
cout << count << endl;
for (int i = 0; i < count; i++)cout << c[i] << " " << d[i] << endl;
return 0;
}
```
我刚写的，关一下呗
by PVZ__2 @ 2023-07-28 10:32:30
@[JiYumo](/user/1011137)
by PVZ__2 @ 2023-07-28 10:32:52
@[PVZ__2](/user/970447) 关了
by Pitiless_boy @ 2023-07-28 10:42:23
@[PVZ__2](/user/970447) AC了谢谢你
by Pitiless_boy @ 2023-07-28 10:45:36
@[JiYumo](/user/1011137) 不用谢
by PVZ__2 @ 2023-07-28 10:47:58
@[PVZ__2](/user/970447) 互关吗，你先？
by sunpengyu @ 2023-07-31 16:48:50
OK
by PVZ__2 @ 2023-08-01 21:25:20