1 条题解

  • 0
    @ 2025-4-14 18:45:30

    Pascal :

    var i,j,k,m,n,p:longint;
        a:array[0..2000] of longint;
        sum:longint;
        ans:longint;
        maxh,minh:longint;
        max,min:longint;
    begin
    
     read(n);
     min:=10000000;
     max:=0;
     for i:=1 to n do
     begin
      read(a[i]);
      if a[i]<min then min:=a[i];
      if a[i]>max then max:=a[i];
     end;
     ans:=maxlongint;
     for minh:=min to max do
      begin
       sum:=0;
       maxh:=minh+17;
       for i:=1 to n do
        begin
         if a[i]>maxh then
           sum:=sum+sqr(a[i]-maxh)
         else
         if a[i]<minh then
           sum:=sum+sqr(a[i]-minh);
        end;
      if sum<ans then ans:=sum;
     end;
     writeln(ans);
    
    end.
    
    • 1

    信息

    ID
    3479
    时间
    1000ms
    内存
    256MiB
    难度
    (无)
    标签
    递交数
    0
    已通过
    0
    上传者