# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
92101 | tjrwodnjs999 | 격자 보존하기 (GA9_preserve) | C++11 | 25 ms | 3016 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 <bits/stdc++.h>
using namespace std;
int n,m,k,arr[100005],a[100005],Max,sum;
int main()
{
scanf("%d%d%d",&n,&m,&k);
for(int i=0;i<m;i++) scanf("%d",arr+i);
for(int i=0;i<m-1;i++) a[i]=arr[i+1]-arr[i]-1;
sort(a,a+m-1,greater<int>());
sum=arr[0]-1; for(int i=0;i<(k-1)/2;i++) sum+=a[i]; Max=sum;
sum=n-arr[m-1]; for(int i=0;i<(k-1)/2;i++) sum+=a[i]; Max=max(Max,sum);
sum=arr[0]-1; sum+=n-arr[m-1]; for(int i=0;i<(k-2)/2;i++) sum+=a[i]; Max=max(Max,sum);
printf("%d",Max);
}
Compilation message (stderr)
# | 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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |