编写具有如下函数原型的非递归两种函数f，负责判断数组a的前n个元素是否从大到小完全有序了，是则返回true，否则返回false。并编制主函数对它们进行调用，以验证其正确性。

　　bool f(int a[], int n)

提示：

非递归函数中只需逐对地判断各a[i]与a[i+1]是否都已从大到小有序排列（i = 0，1，…，n-2）。-Prepared with the following function prototype of two non-recursive function f, is responsible for judging the array a is the first n elements beginning with the largest totally ordered, and that returns true, otherwise returns false. And the preparation of the main function call them to verify their accuracy. bool f (int a [], int n)　Note: non-recursive function of the judge only by the a [i] and a [i+1] is already big to small ordered arrangement (i = 0 , 1, ..., n-2).