fork(5) download
  1. #include <iostream>
  2. #include <cstdio>
  3.  
  4. const int DUMMY = 0;
  5. int a[] = {DUMMY, 2, 5, 9, 3, -2, 7};
  6. int n = (sizeof(a) / sizeof(a[0])) - 1;
  7.  
  8. int main() {
  9. int maxsum = -0x7FFFFFFF;
  10. int maxj = n, save_i = 0, save_j;
  11. for (int j = n - 1; j > 0; --j) {
  12. if (a[j] > a[maxj]) maxj = j;
  13. else {
  14. int sum = a[j] + a[maxj];
  15. if (sum > maxsum) {
  16. maxsum = sum;
  17. save_i = j;
  18. save_j = maxj;
  19. }
  20. }
  21. }
  22.  
  23. if (save_i == 0) printf("No solution\n");
  24. else printf("(%d, %d) = %d, %d\n", save_i, save_j, a[save_i], a[save_j]);
  25. return 0;
  26. }
  27.  
Success #stdin #stdout 0s 3468KB
stdin
Standard input is empty
stdout
(2, 3) = 5, 9