Submission #15817

#	Time	Username	Problem	Language	Result	Execution time	Memory
15817		joonas	전봇대 (KOI13_pole)	C++98	100 / 100	44 ms	2112 KiB

pole

#include <cstdio>
#include <cstdlib>
#include <iostream>

typedef long long int lld;

inline lld min(lld a, lld b){return a>b?b:a;}

lld sum(int *A, int N, int d){
    lld r=0;
    for(int i=0; i<N; ++i) r+=std::abs((1LL)*d*i-A[i]);
    return r;
}

int A[100001];

int main(){
    int i, N;
    scanf("%d",&N);
    for(i=0;i<N;++i) scanf("%d", &A[i]);
    lld L=0, R=1000000000;
    while(L<=R){
        lld d=(L+R)/2;
        if(sum(A,N,d)<sum(A,N,d+1)) R=d-1;
        else L=d+1;
    }
    printf("%lld\n", sum(A,N,L));
    return 0;
}

• Subtask 1: 11 / 11
• Subtask 2: 21 / 21
• Subtask 3: 31 / 31
• Subtask 4: 37 / 37