| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 7422 | gs13068 | 전봇대 (KOI13_pole) | C++98 | 32 ms | 1476 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#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 time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
