Run ID 作者 问题 语言 测评结果 Time Memory 代码长度 提交时间
77531 牛延希 两个数的最小距离II C++ Accepted 1 MS 280 KB 442 2024-06-10 10:24:00

Tests(15/15):


Code:

#include<iostream> #include<cmath> using namespace std; int main(){ long long n,a[1145],minn,minn2,minn1,i,j; cin>>n; for(i=0;i<n;i++){ cin>>a[i]; }minn=abs(a[1]-a[0]); minn1=minn2=n-1; for(i=0;i<n;i++){ for(j=i+1;j<n;j++){ minn=min(minn,abs(a[i]-a[j])); if(minn==abs(a[i]-a[j])){ minn1=min(i,j); minn2=max(i,j); } } }cout<<minn1+1<<" "<<minn2+1; return 0; }