C语言最大子列和的问题，我怎么样才能调用MaxSubSeqSum()这个函数？求大佬指教。

Question

#include
int MaxSubseqSum(int a[]);
{
int ThisSum, MaxSum = 0;
int i, j, k, n;
for (i = 0; i < n; i++) { /*i是子列左端位置*/
for (j = i; j < n; j++) { /*j是子列右端位置*/
ThisSum = 0; /* ThisSum是从A[i] 到 A[j] 的子列和 /
for (k = i; k <= j; k++)
ThisSum += a[k];
if (ThisSum > MaxSum) /如果刚得到的这个子列和更大*/
MaxSum = ThisSum; /*则更新结果*/
}/*j循环结束*/
} /*i循环结束*/
return MaxSum;
}

int main() {
int n, a[1000000], Max;
while (scanf("%d", &n) != EOF)
{
int i, j;
for (i = 0; i < n; i++)
scanf("%d", &a[i]);
}

Max =  MaxSubseqSum(a);

}