Submission #92126

#TimeUsernameProblemLanguageResultExecution timeMemory
92126tjrwodnjs999격자 보존하기 (GA9_preserve)C++11
56 / 100
23 ms2040 KiB
#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=1;i<m;i++) a[i]=arr[i]-arr[i-1]-1; sort(a+1,a+m); reverse(a+1,a+m); for(int i=1;i<m;i++) a[i]+=a[i-1]; if(k==1) Max=max(arr[0]-1,n-arr[m-1]); else if(k%2) Max=max(a[k/2]+max(arr[0]-1,n-arr[m-1]),a[k/2-1]+arr[0]-1+n-arr[m-1]); else Max=max(a[k/2],a[k/2-1]+arr[0]-1+n-arr[m-1]); printf("%d",Max); }

Compilation message (stderr)

preserve.cpp: In function 'int main()':
preserve.cpp:6:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d%d%d",&n,&m,&k);
     ~~~~~^~~~~~~~~~~~~~~~~~~
preserve.cpp:7:31: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     for(int i=0;i<m;i++) scanf("%d",&arr[i]);
                          ~~~~~^~~~~~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...