Submission #7422

#TimeUsernameProblemLanguageResultExecution timeMemory
7422gs13068전봇대 (KOI13_pole)C++98
100 / 100
32 ms1476 KiB
#include<cstdio> #include<algorithm> int a[100000],n; long long calc(int x) { int i; long long r=0; for(i=0;i<n;i++)r+=std::abs(a[i]-a[0]-1LL*i*x); return r; } int main() { int l,r,mid; int i; scanf("%d",&n); for(i=0;i<n;i++)scanf("%d",&a[i]); l=1;r=1000000000; while(l<r) { mid=(l+r)/2; if(calc(mid)<calc(mid+1))r=mid; else l=mid+1; } printf("%lld",calc(l)); }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...