input:seq.in output:seq.out
时间限制: 1000 ms 空间限制: 524288 KB 具体限制
1 #include<bits/stdc++.h> 2 using namespace std; 3 int m,n,k,p,u=1,ans,now,last,c[200001]; 4 bool cmp(int x,int y) 5 { 6 return x<y; 7 } 8 int main() 9 { 10 freopen("seq.in","r",stdin); 11 freopen("seq.out","w",stdout); 12 scanf("%d%d%d",&m,&n,&k); 13 for(int i=1;i<=m;i++) 14 { 15 scanf("%d",&now); 16 if(now!=last+1) 17 { 18 if(i!=1) 19 { 20 p++; 21 c[p]=now-last-1; 22 } 23 } 24 last=now; 25 } 26 sort(c+1,c+1+p,cmp); 27 while(k<p+1) 28 { 29 ans+=c[u]; 30 u++; 31 p--; 32 } 33 printf("%d",ans+m); 34 return 0; 35 }