/// Raihan Ruhin /// CSE, Jahangirnagar University. /// Dhaka-Bangladesh. /// id: raihanruhin (topcoder / codeforces / codechef / uva / uvalive), 3235 (lightoj) /// mail: raihanruhin@ (yahoo / gmail / facebook) /// blog: ruhinraihan.blogspot.com #include<bits/stdc++.h> using namespace std; #define SET(a) memset(a,-1,sizeof(a)) #define CLR(a) memset(a,0,sizeof(a)) #define PI acos(-1.0) #define MOD 1000000007 #define MX 100000 int main() { ios_base::sync_with_stdio(0);cin.tie(0); int tc, kk=1, n, m, x, y, a, b, c, arr[55]; string s; cin>>tc; while(tc--) { cin>>n; for(int i=0;i<n;i++) cin>>arr[i]; sort(arr, arr+n); int gap=0; for(int i=1;i<n;i++) gap=max(gap, arr[i]-arr[i-1]); cout<<"Class "<<kk++<<"\n"; cout<< "Max "<<arr[n-1]<<", Min "<<arr[0]<<", Largest gap "<<gap<<"\n"; } return 0; }
Sunday, 11 October 2015
Class Statistics (UVALive 5682, HDU 4176, Regionals 2011 >> South Pacific)
Subscribe to:
Post Comments (Atom)
No comments:
Post a Comment