Submission #3219622


Source Code Expand

#include <bits/stdc++.h>
using namespace std;

int main(){
  int n,a[200010];
  cin>>n;
  long long sad=0;
  for(int i=0;i<n;++i){
    cin>>a[i];
    a[i]-=i+1;
  }

  sort(a,a+n);

  int b=(n%2?a[n/2]:(a[n/2]+a[n/2-1])/2);

  for(int i=0;i<n;++i){
    sad+=abs(a[i]-b);
  }

  cout << sad << endl;

  return 0;
}

Submission Info

Submission Time
Task C - Linear Approximation
User xuelei
Language C++14 (GCC 5.4.1)
Score 300
Code Size 338 Byte
Status AC
Exec Time 117 ms
Memory 1024 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 300 / 300
Status
AC × 4
AC × 19
Set Name Test Cases
Sample sample_01.txt, sample_02.txt, sample_03.txt, sample_04.txt
All sample_01.txt, sample_02.txt, sample_03.txt, sample_04.txt, sample_01.txt, sample_02.txt, sample_03.txt, sample_04.txt, subtask_1_01.txt, subtask_1_02.txt, subtask_1_03.txt, subtask_1_04.txt, subtask_1_05.txt, subtask_1_06.txt, subtask_1_07.txt, subtask_1_08.txt, subtask_1_09.txt, subtask_1_10.txt, subtask_1_11.txt
Case Name Status Exec Time Memory
sample_01.txt AC 1 ms 256 KB
sample_02.txt AC 1 ms 256 KB
sample_03.txt AC 1 ms 256 KB
sample_04.txt AC 1 ms 256 KB
subtask_1_01.txt AC 1 ms 256 KB
subtask_1_02.txt AC 22 ms 384 KB
subtask_1_03.txt AC 19 ms 384 KB
subtask_1_04.txt AC 54 ms 640 KB
subtask_1_05.txt AC 93 ms 896 KB
subtask_1_06.txt AC 106 ms 1024 KB
subtask_1_07.txt AC 117 ms 1024 KB
subtask_1_08.txt AC 109 ms 1024 KB
subtask_1_09.txt AC 106 ms 1024 KB
subtask_1_10.txt AC 110 ms 1024 KB
subtask_1_11.txt AC 108 ms 1024 KB