Submission #2711421

---

Source Code Expand

#include <algorithm>
#include <iostream>
#include <vector>
#include <math.h>
#include <set>
#include <map>
#include <string>
#include <stack>
#include <queue>
#include <iomanip>
#include <numeric>
#include <tuple>
#include <bitset>
#include <complex>
#define _USE_MATH_DEFINES
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> plglg;
typedef tuple<int, int, int> tiii;
typedef tuple<ll, ll, ll> tlglglg;
typedef complex<double> xy_t;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
double pi = 3.141592653589793;
ll mod = 1000000007;
int intmax = 2147483647;
int intmin = -2147483648;
ll llmax = 9223372036854775807;
ll llmin = -9223372036854775807;
ll inf = llmax / 2;

int main() {
    int N;
    cin >> N;
    int a[N];
    int minmax[2] = {intmax, intmin};
    int minmaxnum[2] = {-1, -1};
    for (int i = 0; i < N; i++) {
        cin >> a[i];
        if (a[i] < minmax[0]) {
            minmax[0] = a[i];
            minmaxnum[0] = i;
        }
        if (a[i] > minmax[1]) {
            minmax[1] = a[i];
            minmaxnum[1] = i;
        }
    }
    int mark = 0;
    if (abs(minmax[0]) <= abs(minmax[1])) {
        mark = 1;
    }
    cout << 2 * (N - 1) << endl;
    for (int i = 0; i < N; i++) {
        if (i != minmaxnum[mark]) {
            cout << minmaxnum[mark] + 1 << " " << i + 1 << endl;
        }
    }
    if (mark == 1) {
        for (int i = 0; i < N - 1; i++) {
            cout << i + 1 << " " << i + 2 << endl;
        }
    } else {
        for (int i = N - 1; i >= 1; i--) {
            cout << i + 1 << " " << i << endl;
        }
    }
}

Submission Info

Judge Result