Submission #92124

#	Time	Username	Problem	Language	Result	Execution time	Memory
92124		tjrwodnjs999	격자 보존하기 (GA9_preserve)	C++11	56 / 100	24 ms	2936 KiB

preserve

#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=1;i<m;i++) a[i]=arr[i]-arr[i-1]-1;
    sort(a+1,a+m,greater<int>());
    for(int i=1;i<m;i++) b[i]+=b[i-1]+a[i];
    if(k==1) Max=max(arr[0]-1,n-arr[m-1]);
    else if(k%2) Max=max(b[k/2]+max(arr[0]-1,n-arr[m-1]),b[k/2-1]+arr[0]-1+n-arr[m-1]);
    else Max=max(b[k/2],b[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]);
                          ~~~~~^~~~~~~~~~~~~~

• Subtask 1: 0 / 9
• Subtask 2: 17 / 17
• Subtask 3: 22 / 22
• Subtask 4: 17 / 17
• Subtask 5: 0 / 35