# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
92121 | tjrwodnjs999 | 격자 보존하기 (GA9_preserve) | C++11 | 24 ms | 2808 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],b[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+100005,greater<int>()); b[0]=a[0];
for(int i=1;i<m-1;i++) b[i]+=b[i-1];
if(k==1) Max=max(arr[0]-1,n-arr[m-1]);
else{
Max=max(b[k/2-1],arr[0]-1+n-arr[m-1]);
if(k>=3) Max=max(Max,b[(k-1)/2-1]+max(arr[0]-1,n-arr[m-1]));
if(k>=4) Max=max(Max,b[(k-2)/2-1]+arr[0]-1+n-arr[m-1]);
}
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... |