Submission #5885

#	Time	Username	Problem	Language	Result	Execution time	Memory
5885		baneling100	전봇대 (KOI13_pole)	C++98	0 / 100	28 ms	2648 KiB

pole

#include <stdio.h>
#include <stdlib.h>
#include <algorithm>

using namespace std;

long long N, x[100001], y[100001], Ans;

void input(void)
{
    long long i;

    scanf("%lld %lld",&N,&i);
    for(i=1 ; i<N ; i++)
    {
        scanf("%lld",&x[i]);
        y[i]=x[i]/i;
    }
    sort(y+1,y+N);
}

long long ABS(long long temp)
{
    if(temp<0)
        return -temp;
    return temp;
}

void process(void)
{
    long long i, temp=0;

    for(i=1 ; i<N ; i++)
    {
        Ans+=ABS(x[i]-i*y[N/2]);
        temp+=ABS(x[i]-i*(y[N/2]+1));
    }
    if(Ans>temp)
        Ans=temp;
}

void output(void)
{
    printf("%lld",Ans);
}

int main(void)
{
    input();
    process();
    output();

    return 0;
}

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