9.2 NOIP提高组试题精解(2)

9-18 fruit.c

 #include <stdio.h>
 #define MAXN 10000
 int Queue1[MAXN], Queue2[MAXN];
 void Insert(int n, int data)    //按增序插入数组
 {
    int i, mid, left, right;
    left = ;
    right = n - ;
     || data >= Queue1[right])    //最大
    {
       Queue1[n] = data;
       return;
    }
    else if (data < Queue1[left])    //最小
    {
       ; i--)
       {
          Queue1[i + ] = Queue1[i];
       }
       Queue1[] = data;
       return;
    }
    while (left <= right)
    {
       mid = (left + right) / ;
       if (Queue1[mid] <= data)
       {
          left = mid + ;
       } else if (Queue1[mid] > data)
       {
          right = mid - ;
       }
    }
    if (Queue1[mid] < data)
       mid++;
    ; i >= mid; i--)    //插入到a[mid]之前
    {
       Queue1[i + ] = Queue1[i];
    }
    Queue1[mid] = data;
 }
 int Calc(int a[], int n)    //按增序插入数组
 {
    int i, frontOld, frontNew, rearNew;
    ;
    )
       ];
    )
       ] + a[];
    ; i < n; i++)    //按增序插入数组
       Insert(i, a[i]);
    //先加上前两个
    frontOld = frontNew = rearNew = ;
    Queue2[rearNew++] = Queue1[frontOld] + Queue1[frontOld + ];
    frontOld += ;
    while (frontOld < n)    //合并Queue1的所有元素
    {
       if (Queue1[frontOld] > Queue2[frontNew])
          sum = Queue2[frontNew++];
       else
          sum = Queue1[frontOld++];

       if (frontNew < rearNew && frontOld < n)
       {
          if (Queue1[frontOld] > Queue2[frontNew])
             sum += Queue2[frontNew++];
          else
             sum += Queue1[frontOld++];
       }
       else if (frontNew < rearNew)
          sum += Queue2[frontNew++];
       else if (frontOld < n)
          sum += Queue1[frontOld++];
       Queue2[rearNew++] = sum;
    }
    )    //如果Queue2的元素没有合并完
    {
       Queue2[rearNew++] = Queue2[frontNew] + Queue2[frontNew + ];
       frontNew += ;
    }
    sum = ;
    ; i < rearNew; i++)
       sum += Queue2[i];
    return sum;
 }
 int main()
 {
    int n, i, sum;
     };
    FILE *fp1, *fp2;
    if ((fp1 = fopen("fruit.in", "r")) == NULL)
    {
       printf("不能打开文件!\n");
       exit();
    }
    fscanf(fp1, "%d\n", &n); //果子种类数
    ; i < n; i++) //各类果子的数量
       fscanf(fp1, "%d", &a[i]);
    fclose(fp1);
    sum = Calc(a, n);
    if ((fp2 = fopen("fruit.out", "w")) == NULL)
    {
       printf("不能打开文件!\n");
       exit();
    }
    printf("%d\n", sum);
    fprintf(fp1, "%d\n", sum);
    fclose(fp2);
    getch();
    ;
 }

9-19 chorus.c

 #include <stdio.h>
 #define MAXN 101
 int main()
 {
    }, flag2[MAXN]={}, a[MAXN]={};
    int n, max;
    int i, j;
    FILE *fp1, *fp2;
    if ((fp1 = fopen("chorus.in", "r")) == NULL)
    {
       printf("不能打开文件!\n");
       exit();
    }
    fscanf(fp1, "%d\n", &n);
    ; i <= n; i++)
       fscanf(fp1, "%d", &a[i]);
    fclose(fp1);
    a[] = ;    //设置为一个最小值
    ; i <= n; i++) //用动规求最长升序序列
    {
       ; j >= ; j--)
       {
           > flag1[i]))
             flag1[i] = flag1[j] + ;
       }
    }
    a[n + ] = ;    //最后设置一个最小值
    ; i--)//用动规求最长降序序列
    {
       ; j <= n + ; j++)
       {
           > flag2[i])
             flag2[i] = flag2[j] + ;
       }
    }
    max = ;
    ; i <= n; i++) //计算升序和降序序列的最多人数
    {
       if (flag1[i] + flag2[i] > max)
       {
          max = flag1[i] + flag2[i];
          printf("%d,%d\n",flag1[i],flag2[i]);
       }
    }
    if ((fp2 = fopen("chorus.out", "w")) == NULL)
    {
       printf("不能打开文件!\n");
       exit();
    }
    printf(); //减去要保留的人数，就得到出列人数
    fprintf(fp2, );
    fclose(fp2);
    getch();
    ;
 }