[{"createTime":1735734952000,"id":1,"img":"hwy_ms_500_252.jpeg","link":"https://activity.huaweicloud.com/cps.html?fromacct=261f35b6-af54-4511-a2ca-910fa15905d1&utm_source=V1g3MDY4NTY=&utm_medium=cps&utm_campaign=201905","name":"华为云秒杀","status":9,"txt":"华为云38元秒杀","type":1,"updateTime":1735747411000,"userId":3},{"createTime":1736173885000,"id":2,"img":"txy_480_300.png","link":"https://cloud.tencent.com/act/cps/redirect?redirect=1077&cps_key=edb15096bfff75effaaa8c8bb66138bd&from=console","name":"腾讯云秒杀","status":9,"txt":"腾讯云限量秒杀","type":1,"updateTime":1736173885000,"userId":3},{"createTime":1736177492000,"id":3,"img":"aly_251_140.png","link":"https://www.aliyun.com/minisite/goods?userCode=pwp8kmv3","memo":"","name":"阿里云","status":9,"txt":"阿里云2折起","type":1,"updateTime":1736177492000,"userId":3},{"createTime":1735660800000,"id":4,"img":"vultr_560_300.png","link":"https://www.vultr.com/?ref=9603742-8H","name":"Vultr","status":9,"txt":"Vultr送$100","type":1,"updateTime":1735660800000,"userId":3},{"createTime":1735660800000,"id":5,"img":"jdy_663_320.jpg","link":"https://3.cn/2ay1-e5t","name":"京东云","status":9,"txt":"京东云特惠专区","type":1,"updateTime":1735660800000,"userId":3},{"createTime":1735660800000,"id":6,"img":"new_ads.png","link":"https://www.iodraw.com/ads","name":"发布广告","status":9,"txt":"发布广告","type":1,"updateTime":1735660800000,"userId":3},{"createTime":1735660800000,"id":7,"img":"yun_910_50.png","link":"https://activity.huaweicloud.com/discount_area_v5/index.html?fromacct=261f35b6-af54-4511-a2ca-910fa15905d1&utm_source=aXhpYW95YW5nOA===&utm_medium=cps&utm_campaign=201905","name":"底部","status":9,"txt":"高性能云服务器2折起","type":2,"updateTime":1735660800000,"userId":3}]
<>2021第十二届蓝桥杯C/C++B组模拟赛
问题描述：
给定一个序列a_1,a_2,…,a_n,其中a_1 < a_2 < …< a_n。
相邻两个数之间的差（后一个数减去前一个数）称为它们的间隙。
请问序列中最大的间隙是多少？
输入格式：
输入的第一行包含一个整数n，表示序列的长度。
第二行包含n个正整数，为给定的序列。
输出格式：
输出一个整数，表示序列中最大的间隙。
#include <stdio.h> int main() { int n; int i; int num[1000]; int count[999];
//将间隙放入数组方便比较 int temp; //中间变量 scanf_s("%d", &n); for (i = 0; i < n; i++) {
scanf_s("%d", &num[i]); } for (i = 0; i < n; i++) //计算出间隙，并放入count数组中 { count[i]
= num[i + 1] - num[i]; } for (i = 0; i < n - 1; i++) //找出最大的间隙 { if (count[0] <
count[i]) { temp = count[0]; count[0] = count[i]; count[i] = temp; } } printf(
"%d", count[0]); return 0; }
