fork(1) download
copy 
  1. #include <bits/stdc++.h>
  2. using namespace std;
  3. #define ll long long
  4. #define pb push_back
  5. #define mp make_pair
  6. #define ff first
  7. #define ss second
  8. #define vsort sort(v.begin(),v.end())
  9. #define mod 1000000007
  10. #define fastio ios_base::sync_with_stdio(false),cin.tie(NULL),cout.tie(NULL);
  11.  
  12. int Solve()
  13. {
  14. 	int n;
  15. 	cin >> n;
  16.  
  17. 	std::vector<int> v;
  18.  
  19. 	for (int i = 0; i < n; i++)
  20. 	{
  21. 		int num; cin >> num;
  22. 		v.pb(num);
  23. 	}
  24.  
  25. 	int max_size = 0, index = -1;
  26.  
  27. 	for (int i = 0; i < n; i++)
  28. 	{
  29. 		if (i == n - 1)
  30. 		{
  31. 			if (index == -1)
  32. 			{
  33. 				continue;
  34. 			}
  35. 			else
  36. 			{
  37. 				if (v[i] > max_size)
  38. 				{
  39. 					max_size = v[i];
  40. 					index = i;
  41. 				}
  42. 			}
  43. 		}
  44. 		else if (v[i] > max_size && v[i] != v[i + 1])
  45. 		{
  46. 			max_size = v[i];
  47. 			index = i;
  48. 		}
  49. 	}
  50.  
  51. 	if (index == -1)
  52. 		return -1;
  53.  
  54. 	return index + 1;
  55. }
  56.  
  57. int main()
  58. {
  59. 	fastio
  60.  
  61. #ifndef ONLINE_JUDGE
  62. 	freopen("input.txt", "r", stdin);
  63. 	freopen("output.txt", "w", stdout);
  64. #endif
  65.  
  66. 	int T;
  67. 	cin >> T;
  68.  
  69. 	while (T-- > 0)
  70. 	{
  71. 		int index = Solve();
  72.  
  73. 		cout << index << endl;
  74. 	}
  75.  
  76. 	return 0;
  77. }
Success #stdin #stdout 0s 4496KB
comments (?)
stdin
copy 
6
5
5 3 4 4 5
3
1 1 1
5
4 4 3 4 4
5
5 5 4 3 2
3
1 1 2
5
5 4 3 5 5
stdout
copy 
1
-1
2
2
3
1
https://ideone.com/q51Cab
language:
C++14 (gcc 8.3)
created:
5 years ago
visibility:
secret

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!