Код:
#include <iostream>
#include <string>
using namespace std;
void printArray(int** arr, size_t X, size_t Y) {
for (size_t i = 0; i < X; ++i) {
for (size_t j = 0; j < Y; ++j) {
cout << arr[i][j] << " ";
}
cout << endl;
}
}
int main() {
size_t X, Y;
cout << "Number of rows in the array: ";
cin >> X;
cout << "Elements in each row of the array: ";
cin >> Y;
int** arr = new int* [X];
for (size_t i = 0; i < X; ++i) {
arr[i] = new int[Y];
cout << "#" << i + 1 << ": ";
for (size_t j = 0; j < Y; ++j)
cin >> arr[i][j];
}
size_t index;
cout << "index to check the row for non-decreasing ordering: ";
cin >> index;
--index; // numbering from 1
bool flag = 1;
for (int i = 0; i < Y - 1; ++i) {
if (!(arr[index][i] <= arr[index][i + 1])) {
cout << "No, " << i + 1 << (i + 1 == 1 ? "st" : (i + 1 == 2 ? "nd" : (i + 1 == 3) ? "rd" : "th")) << " element (" << arr[index][i] << ") violates the non-decreasing ordering (" << arr[index][i] << " > " << arr[index][i + 1] << ").\n";
flag = 0;
break;
}
}
if (flag)
cout << "Yes, the specified row is ordered in non-decreasing order.\n";
flag = 1;
index = 1;
cout << "index to check the column for non-increasing ordering: ";
cin >> index;
--index;
flag = 1;
for (int i = 0; i < X - 1; ++i) {
if (!(arr[i][index] >= arr[i + 1][index])) {
cout << "No, " << i + 1 << (i + 1 == 1 ? "st" : (i + 1 == 2 ? "nd" : (i + 1 == 3) ? "rd" : "th")) << " element (" << arr[i][index] << ") violates the non-increasing ordering (" << arr[i][index] << " < " << arr[i][index + 1] << ").\n";
flag = 0;
break;
}
}
if (flag)
cout << "Yes, the specified row is ordered in non-increasing order.\n";
}
В задании исходный код программы введен немного неправильно, поэтому я решил его загуглить и нашел во с идентичными кодом без ответа. Код, вроде, рабочий, но я его серьезно не тестировал.
N = 1E5
a, p, s = [], [], []
def main():
n = k = i = j = 0
(n, k) = (int(input()), int(input()))
p = [0] * n
s = [0] * n
for i in range(0, n):
a.append(int(input()))
if a[i] > a[j]:
p[i] = i
j = i
else:
p[i] = p[j]
j = n - 1
for i in range(n - 1, -1, -1):
if (a[i] >= a[j]):
s[i] = i
j = i
else:
s[i] = s[j]
m, l, r = 0, 0, k + 1
i = l
for j in range(r, n):
t = a[p[i]] + a[s[j]]
if t > m:
l = p[i]
r = s[j]
m = t
i += 1;
print(str(l + 1) + " " + str(r + 1))
if __name__ == "__main__":
main()
