A - Reconnaissance 2 士兵立正啦…_c++n soldiers stand in a circle. for each soldier -CSDN博客

本文链接：https://blog.csdn.net/wwk0125/article/details/21945791

A -Reconnaissance 2 _p

Time Limit: 2000MS

Memory Limit: 262144K

64bit IO Format: %I64d& %I64u

Description

n soldiers standin a circle. For each soldier hisheight a_i is known. Areconnaissance unit can be made of suchtwo neighbouring soldiers,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 anypair 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 intheir order in the circle — n space-separatedintegersa₁, a₂, ..., a_n (1 ≤ a_i ≤ 1000). The soldier heightsare given in clockwise or counterclockwise direction.

Output

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

Sample Input

Input

5

10 12 13 15 10

Output

5 1

Input

4

10 20 30 40

Output

1 2

[Submit] [GoBack] [Status]

题目要求：求站成一圈的士兵相邻身高差最小的两士兵的编号（有多对的话取找到的第一队）

#include<iostream>
#include<cmath>
using namespace std;
int main()
{
        int n,a[1000],i,j,min;
        while(scanf("%d",&n)!=EOF)
        {
                min=10001;
                  cin>>a[1];
                for(i=2;i<=n;i++)
                {
                        cin>>a[i];
                      if(abs(a[i]-a[i-1])<min)
                          {   min=abs(a[i]-a[i-1]);
                           j=i;
                          }
                }
       if(abs(a[n]-a[1])<min)
                   cout<<n<<" 1"<<endl;
           else
                   cout<<j-1<<" "<<j<<endl;
           }
        return 0;
}