fork download 
  1. #include <bits/stdc++.h>
  2. using namespace std;
  3. #define int              long long int
  4. #define double           long double
  5. #define print(a)         for(auto x : a) cout << x << " "; cout << endl
  6.  
  7.  
  8. const int M = 1000000007;
  9. const int N = 3e5+9;
  10. const int INF = 2e9+1;
  11. const int LINF = 2000000000000000001;
  12.  
  13. inline int power(int a, int b, int mod=M) {
  14.     int x = 1;
  15.     a %= mod;
  16.     while (b) {
  17.         if (b & 1) x = (x * a) % mod; 
  18.         a = (a * a) % mod;
  19.         b >>= 1;
  20.     }
  21.     return x;
  22. }
  23.  
  24.  
  25. //_ ***************************** START Below *******************************
  26.  
  27.  
  28.  
  29.  
  30. vector<int> a;
  31.  
  32. vector<int> consistency(int n){
  33.  
  34. 	vector<int> ans;	
  35. 	bool isNeg = true;
  36. 	for(int i=n-1; i>=0; i--){
  37. 		if(a[i]>0) {
  38. 			isNeg = false;
  39. 			break;
  40. 		}
  41. 	}
  42. 	if(isNeg) return {};
  43.  
  44. 	int flipCt = 0;
  45. 	for(int i=n-1; i>=0; i--){
  46. 		int val = a[i];
  47. 		if( (flipCt & 1) ) val *= -1;
  48.  
  49. 		if(val>0){
  50. 			ans.push_back(i+1);
  51. 			flipCt++; 
  52. 		}
  53. 	}
  54.  
  55.  
  56. 	return ans;
  57. }
  58.  
  59.  
  60.  
  61.  
  62.  
  63.  
  64.  
  65.  
  66.  
  67.  
  68.  
  69.  
  70.  
  71.  
  72.  
  73. int practice(int n){
  74.  
  75.  
  76.     return 0;
  77. }
  78.  
  79.  
  80.  
  81.  
  82.  
  83. void solve() {
  84.  
  85.     int n;
  86.     cin>> n;
  87.  
  88.     a.resize(n);
  89.     for(int i=0; i<n; i++) cin >> a[i];
  90.  
  91.     auto ans =  consistency(n);
  92.  
  93.     cout << ans.size() << endl;
  94.     if(ans.size() == 0) return;
  95.     for(auto& t : ans) cout << t << " "; cout << endl;
  96.  
  97.  
  98. }
  99.  
  100.  
  101.  
  102.  
  103.  
  104. int32_t main() {
  105.     ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
  106.  
  107.     int t = 1;
  108.     cin >> t;
  109.     while (t--) {
  110.         solve();
  111.     }
  112.  
  113.     return 0;
  114. }
Success #stdin #stdout 0.01s 5284KB
comments (?)
stdin 
3
5
-1 -2 -3 -5 -4
5
-1 -2 3 -5 4
4
5 7 10 19
stdout 
0
4
5 4 3 2 
1
4
https://ideone.com/hb6tHv
language:
C++14 (gcc 8.3)
created:
1 day ago
visibility:
public

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!