Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <stdio.h>
- using namespace std;
- int main()
- {
- int n,m,g,t;
- scanf("%d",&n);
- while(n>0)
- {
- vector<int> v;
- int max=0;
- scanf("%d",&m);
- for(int i=0;i<m;i++)
- {
- scanf("%d",&g);
- v.push_back(g);
- }
- for(int i=0;i<v.size();i++)
- {
- for(int j=i;j<v.size();j++)
- {
- if(v[i]<v[j])
- {
- t=v[j]-v[i];
- if(max<t)
- max=t;
- }
- }
- }
- if(max==0)
- printf ("%s \n", "UNFIT");
- if(max>0)
- printf("%d\n",max);
- n--;
- }
- return 0;
- }
Add Comment
Please, Sign In to add comment