Submission #15820

#	Time	Username	Problem	Language	Result	Execution time	Memory
15820		ggoh	전봇대 (KOI13_pole)	C++98	100 / 100	46 ms	1864 KiB

pole

#include<cstdio>
#include<algorithm>
long long i,x[100005],a,m,M,p,q,h;
long long abs(long long z, long long w){return z>w?z-w:w-z;}
long long f(long long t)
{
	m=0;
	for(i=0;i<a;i++)
	{
		m+=abs(x[i],i*t);
	}
	return m;
}
main()
{
	scanf("%lld",&a);
	for(i=0;i<a;i++)scanf("%lld",&x[i]);
	p=0;q=1e9;
	while(p!=q-1)
	{
		h=(p+q)/2;
		if(f(h)<f(h+1))q=h;
		else p=h;
	}
	printf("%lld",std::min(f(p),f(q)));
}

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