1.3.2(extra)

最新推荐文章于 2024-02-18 22:49:27 发布

Eminem1147

最新推荐文章于 2024-02-18 22:49:27 发布

阅读量184

点赞数

分类专栏： USACO

本文链接：https://blog.csdn.net/qq_33765907/article/details/50981076

版权

USACO 专栏收录该内容

35 篇文章 0 订阅

订阅专栏

/*
ID:18861501
LANG:C++
TASK:barn1
*/
/*------------------Header Files------------------*/
#include <iostream>
#include <cstring>
#include <string>
#include <cstdio>
#include <algorithm>
#include <cstdlib>
#include <ctype.h>
#include <cmath>
#include <stack>
#include <queue>
#include <map>
#include <vector>
#include <limits.h>
using namespace std;
/*------------------Definitions-------------------*/
#define LL long long
#define PI acos(-1.0)
#define INF 0x3F3F3F3F
/*---------------------Work-----------------------*/
int num[250];
struct interval
{
	int start,end;
	int time;
} s[250];
bool cmp1(int a,int b)
{
	return a<b;
}
bool cmp2(interval a,interval b)
{
	return a.time>b.time;
}
void work()
{
	int M,S,C,a;
	scanf("%d%d%d",&M,&S,&C);
	for(int i=1; i<=C; i++)
		scanf("%d",&num[i]);
	sort(num+1,num+C+1,cmp1);
	for(int i=1; i<=C-1; i++)
	{
		s[i].start=num[i];
		s[i].end=num[i+1];
		s[i].time=num[i+1]-num[i];
	}
	sort(s+1,s+C,cmp2);
	int sum=num[C]-num[1]+1;
	if(M>=C) //这里要注意大小关系，否则下面循环数组越界，无需去掉M个间隔，挂了一次
	{
		printf("%d\n",C);
		return;
	}
	for(int i=1; i<M; i++)
	{
		sum=sum-(s[i].end-s[i].start-1);
	}
	printf("%d\n",sum);
}
/*------------------Main Function------------------*/
int main()
{
	//freopen("test.txt","r",stdin);
	freopen("barn1.out","w",stdout);
	freopen("barn1.in","r",stdin);
	work();
	return 0;
}