本代码内存小，时间复杂度小

by QFIT 点此加盟

#include<bits/stdc++.h> using namespace std; int T; long long a[4]; int main(){ cin>>T; while(T--!=0){ cin>> a[1] >> a[2] >> a[3]; sort(a+1,a+4); if(a[1]==a[2]&&a[2]==a[3]) { cout<<0; continue; } else if(a[1]==a[2]) a[3]-=1; else if(a[2]==a[3]){ a[2]-=1; a[3]-=1; } else { a[1]+=1; a[3]-=1; } cout << abs(a[1]-a[2]) + abs(a[2]-a[3]) + abs(a[1]-a[3])<<endl; } return 0; }

#include<bits/stdc++.h> #include <iostream> #include <algorithm> #include <cmath> using namespace std; long long d(long long a, long long b, long long c) { return abs(a - b) + abs(a - c) + abs(b - c);//abs:求绝对值 } int main() { int t; cin >> t; while (t--) { long long a, b, c; cin >> a >> b >> c; long long ans = 1e18; for (int i = -1; i <= 1; i++) { for (int j = -1; j <= 1; j++) { for (int k = -1; k <= 1; k++) { long long A = a + i,B = b + j,C = c + k; ans = min(ans, d(A, B, C));//min:求最小值 } } } cout << ans << endl; } return 0; }

#include<bits/stdc++.h> using namespace std; int T; long long a[4]; int main(){ cin>>T; while(T--!=0){ cin>> a[1] >> a[2] >> a[3]; sort(a+1,a+4); if(a[1]==a[2]&&a[2]==a[3]){ cout<<0; continue; } else if(a[1]==a[2]) a[3]-=1; else if(a[2]==a[3]){ a[2]-=1; a[3]-=1; } else{ a[1]+=1; a[3]-=1; } cout << abs(a[1]-a[2]) + abs(a[2]-a[3]) + abs(a[1]-a[3])<<endl; } return 0; }

#include<iostream> #include<cmath> using namespace std; void f(){ long long a,b,c,d,t; cin>>a>>b>>c; d=abs(a-b)+abs(b-c)+abs(c-a); for(int i=-1;i<2;++i){ for(int j=-1;j<2;++j){ for(int k=-1;k<2;++k){ t=abs(a-b+i-j)+abs(b-c+j-k)+abs(c-a+k-i); if(t<d) d=t; } } } cout<<d<<endl; } int main(){ int t; cin>>t; for(int i=0;i<t;++i) f(); return 0; }