Submission #3692652

---

Source Code Expand

#include <iostream>

using namespace std;

int main(){
    int N;
    int a[50];
    int a_max = -2000000;
    int a_min = 2000000;
    int min_index, max_index;
    int count_neg = 0;
    int count_pos = 0;
    cin >> N;
    for(int i = 0; i < N; i++){
        cin >> a[i];
        
        if(a[i] < a_min){
            a_min = a[i];
            min_index = i;
        }
        if(a[i] > a_max){
            a_max = a[i];
            max_index = i;
        }
        if(a[i] > 0) count_pos++;
        if(a[i] < 0) count_neg++;
    }
    if(a_min < 0 && a_max > 0){
        if(abs(a_max) > abs(a_min)){
            cout << count_neg+N-1 << endl;
            for(int i = 0; i < N ;i++){
                if(a[i] < 0){
                    a[i] = a[i] + a_max;
                    cout << max_index+1 << ' ' << i+1 << endl;
                }
            }
            for(int i = 1; i < N ;i++){
                cout << i << ' ' << i+1 << endl;
            }
        }else{
            cout << count_pos+N-1 << endl;
            for(int i = 0; i < N ;i++){
                if(a[i] > 0){
                    a[i] = a[i] + a_min;
                    cout << min_index+1 << ' ' << i+1 << endl;
                }
            }
            for(int i = N-1; i > 0 ;i--){
                cout << i+1 << ' ' << i << endl;
            }
        }
    }else if(a_max > 0){
        cout << N-1 << endl;
        for(int i = 1; i < N ;i++){
            cout << i << ' ' << i+1 << endl;
        }
    }else{
        cout << N-1 << endl;
        for(int i = N-1; i > 0 ;i--){
            cout << i+1 << ' ' << i << endl;
        }
    }
}

Submission Info

Judge Result