Verilog HDL 出租车计费器实现

数字电路的期末大作业~历经了很多失败才成功

#include<iostream>
#include<iomanip>
using namespace std;
void Qsort(long a[], long low, long high)
{
    if(low >= high)
    {
        return;
    }
    long first = low;
    long last = high;
    long key = a[first];/*用字表的第一个记录作为枢轴*/
 
    while(first < last)
    {
        while(first < last && a[last] >= key)
        {
            --last;
        }
 
        a[first] = a[last];/*将比第一个小的移到低端*/
 
        while(first < last && a[first] <= key)
        {
            ++first;
        }
         
        a[last] = a[first];    
/*将比第一个大的移到高端*/
    }
    a[first] = key;/*枢轴记录到位*/
    Qsort(a, low, first-1);
    Qsort(a, first+1, high);
}
int main()
{
long n,l;
while(cin>>n>>l)
{
        double final = 0;
long length = 0;
long * light;
light = new long [n];
for(long i = 0;i < n;i++)
{
     cin>>light[i];
}
Qsort(light,0,n-1);
length = light[0] - 0;
length = length * 2;
   for(long s = 0;s < n-1;s++)
   {
           long j = light[s+1]-light[s];
           if(j > length)
           length = j;
    }
    long high = l - light[n-1];
    high = high*2;
    if(high > length)
    length = high;
    final = length /2.0;
    printf("%.2lf\n",final);
    //cout<<setprecision(3)<<final<<endl;
}
return 0;