{
  "type": "code_options",
  "author": "csdn.net",
  "source": "solution.md",
  "exercise_id": "4583002df4554ecd90bef873754b79e1",
  "keywords": "算法初阶,最小值和最大值,排序和顺序统计量,中位数和顺序统计量",
  "title": "二维数组找最值",
  "desc": [
    {
      "content": "\n<pre><p>从键盘输入m(2&lt;&#61;m&lt;&#61;6)行n(2&lt;&#61;n&lt;&#61;6)列整型数据&#xff0c;编程找出其中的最大值及其所在位置的行列下标值并输出。\n输入格式:\n在第一行输入数据的行数m和列数n的值&#xff0c;从第二行开始以二维数组的形式依次输入m行n列整型数据。\n输出格式:\n依次输出最大值及其所在位置的行列下标值&#xff0c;中间以逗号,分隔&#xff0c;最后换行。\n</pre>输入样例:</p>\n<pre>\n<code>3 4\n1 2 3 4\n8 9 7 6\n5 6 7 0</code></pre>\n<p>输出样例:</p>\n<pre>\n<code>9,1,1</code></pre>",
      "language": "markdown"
    }
  ],
  "answer": [
    {
      "content": "",
      "language": "cpp"
    }
  ],
  "prepared": [
    [
      {
        "content": "",
        "language": "cpp"
      }
    ],
    [
      {
        "content": "",
        "language": "cpp"
      }
    ],
    [
      {
        "content": "",
        "language": "cpp"
      }
    ]
  ],
  "template": {
    "content": "#include <stdio.h>\nint main ()\n{\n\tint a[6][6];\n\tint m,n;\n\tint i,j;\n\tint max;\n\tint indexx=0,indexy=0;\n\tscanf(\"%d %d\",&m,&n);\n\tfor (i = 0;i<m;i++)\n\t{\n\t\tfor (j = 0;j<n;j++)\n\t\t{\n\t\t\tscanf(\"%d\",&a[i][j]);\n\t\t\tif(i == 0 && j==0)\n\t\t\t{\n\t\t\t\tmax = a[i][j];\n\t\t\t\tindexx = 0;\n\t\t\t\tindexy = 0;\n\t\t\t}else\n\t\t\t{\n\t\t\t\tif (a[i][j] > max)\n\t\t\t\t{\n\t\t\t\t\tmax = a[i][j];\n\t\t\t\t\tindexx = i;\n\t\t\t\t\tindexy = j;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\tprintf(\"%d,%d,%d\\n\",max,indexx,indexy);\n\treturn 0;\n}",
    "language": "cpp"
  },
  "node_id": "dailycode-5afc633f3ca1461e858b1cde58b04b68",
  "license": "csdn.net",
  "created_at": 1637894158,
  "topic_link": "https://bbs.csdn.net/topics/600470252"
}