CodeForces 34A Reconnaissance 2

最新推荐文章于 2022-08-15 11:24:25 发布

叶孤心丶

最新推荐文章于 2022-08-15 11:24:25 发布

阅读量1.6k

点赞数

CC 4.0 BY-SA版权

分类专栏： --- CodeForces ---- ----- %d ------ ------- 数据结构 ------

本文链接：https://blog.youkuaiyun.com/yeguxin/article/details/41153887

------- 数据结构 ------ 同时被 3 个专栏收录

122 篇文章

订阅专栏

----- %d ------

54 篇文章

订阅专栏

--- CodeForces ----

51 篇文章

订阅专栏

该问题描述了一个士兵圈中寻找身高差最小相邻士兵的任务。输入包含士兵人数及身高，输出是符合条件的士兵索引对。若有多组解，任选一组输出。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Reconnaissance 2

Time Limit:2000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64u

Submit Status Practice CodeForces 34A

Description

n soldiers stand in a circle. For each soldier his height a_i is known. A reconnaissance unit can be made of such two neighbouringsoldiers, whose heights difference is minimal, i.e. |a_i - a_j| is minimal. So each of them will be less noticeable with the other. Output any pair of soldiers that can form a reconnaissance unit.

Input

The first line contains integer n (2 ≤ n ≤ 100) — amount of soldiers. Then follow the heights of the soldiers in their order in the circle — n space-separated integers a₁, a₂, ..., a_n (1 ≤ a_i ≤ 1000). The soldier heights are given in clockwise or counterclockwise direction.

Output

Output two integers — indexes of neighbouring soldiers, who should form a reconnaissance unit. If there are many optimum solutions, output any of them. Remember, that the soldiers stand in a circle.

Sample Input

Input

5
10 12 13 15 10

Output

5 1

Input

4
10 20 30 40

Output

1 2

       大体题意：n个人围成一个圈，下面分别是n个人的身高，求这个圈里面的相邻的两个人身高差最小的编号是那两个？其中编号按输入数据的顺序排列，第一个是1，最后一个是n

AC代码：

#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#include<math.h>

int main()
{
    int n;
    while(scanf("%d",&n)!=EOF)
    {
        int a[2101];
        int ii,jj;
        int cha;
        int min = 100000;
        for(int i=1; i<=n; i++)
        {
            scanf("%d",&a[i]);
            if(i!=1)
            {
                cha = fabs(a[i] - a[i-1]);
                if(min > cha)
                {
                    min  = cha;
                    ii = i-1;
                    jj = i;
                }
            }

        }
        cha = fabs(a[1] - a[n]);
        if(min > cha)
        {
            min  = cha;
            ii = n;
            jj = 1;
        }
        printf("%d %d\n",ii,jj);
    }
    return 0;
}