3 条题解
-
-1
#include <bits/stdc++.h> using namespace std; int a[100005]; int cmp (int a, int b) { return a > b; } int main() { int n, m, k = 0, z; cin >> n >> m; for (int i = 1; i <= n * m; i++) cin >> a[i]; z = a[1]; sort (a + 1, a + n * m + 1, cmp); for (int i = 1; i <= m; i++) { if (i % 2 != 0) { for (int j = 1; j <= n; j++) { k++; if (a[k] == z) { cout << i << " " << j << endl; return 0; } } } else { for (int j = n; j >= 1; j--) { k++; if (a[k] == z) { cout << i << " " << j << endl; return 0; } } } } return 0; }
信息
- ID
- 3391
- 时间
- 1000ms
- 内存
- 256MiB
- 难度
- 6
- 标签
- 递交数
- 36
- 已通过
- 11
- 上传者