在横线位置处对如下程序进行补充完善。 int findMax(int[], int); int main() { int a[] = {1, 2, 3, 4, 5, 10, 9, 8}; int pos = findMax(a, sizeof(a) / sizeof(int)); cout << "最大元素是:" << a[pos] << endl; return 0; } int findMax(int v[], int n) { int pos = 0; for (int i = 0; i < n; i++) { if ( _______________ ) pos = i; } return pos; }