1042C - Array Product（讨论+细节)

https://codeforces.com/problemset/problem/1042/C

---

思路：讨论

有0,负数为奇----找一个最大的负数和0合并消去

有0，负数为偶数---把0合并消去0

无0，负数为奇----找一个最大的负数消去其本身

无0，负数为偶---直接搞

#include<iostream>
#include<vector>
#include<queue>
#include<cstring>
#include<cmath>
#include<map>
#include<set>
#include<cstdio>
#include<algorithm>
#define debug(a) cout<<#a<<"="<<a<<endl;
using namespace std;
const int maxn=2e5+1000;
typedef long long LL;
inline LL read(){LL x=0,f=1;char ch=getchar();	while (!isdigit(ch)){if (ch=='-') f=-1;ch=getchar();}while (isdigit(ch)){x=x*10+ch-48;ch=getchar();}
return x*f;}
LL a[maxn];
queue<LL>que;
int main(void)
{
  	cin.tie(0);std::ios::sync_with_stdio(false);
    LL n;cin>>n;
    LL f=0;LL num0=0;
    for(LL i=1;i<=n;i++){
        cin>>a[i];
        if(a[i]<0) f++;
        if(a[i]==0) num0++;
    }
    if(num0==0&&(f%2==0)){
        for(LL i=1;i<=n;i++) que.push(i);
    }
    else if(num0==0&&(f&1)){
        LL mx=-1e18;LL pos=0;
        for(LL i=1;i<=n;i++){
            if(mx<a[i]&&a[i]<0){
                mx=a[i];pos=i;
            }
        }
        for(LL i=1;i<=n;i++) if(i!=pos) que.push(i);
        cout<<"2 "<<pos<<"\n";
    }
    else if(num0!=0&&(f%2==0)){
        vector<LL>pos;
        for(LL i=1;i<=n;i++){
            if(a[i]==0) pos.push_back(i);
            else que.push(i);
        }
        for(LL i=0;i<pos.size()-1;i++){
            cout<<"1 "<<pos[i]<<" "<<pos[i+1]<<"\n";
        }
        if(pos.size()!=n)     cout<<"2 "<<pos[pos.size()-1]<<"\n";
    }
    else if(num0!=0&&(f&1)){
        vector<LL>pos;
        LL mx=-1e18;LL mxpos=0;
        for(LL i=1;i<=n;i++){
            if(mx<a[i]&&a[i]<0){
                mx=a[i];
                mxpos=i;
            }
        }
        for(LL i=1;i<=n;i++){
            if(a[i]==0) pos.push_back(i);
            else if(i==mxpos) pos.push_back(i);
            else que.push(i);
        }
        for(LL i=0;i<pos.size()-1;i++){
            cout<<"1 "<<pos[i]<<" "<<pos[i+1]<<"\n";
        }
        if(pos.size()!=n) cout<<"2 "<<pos[pos.size()-1]<<"\n";
    }
    while(!que.empty()){
        LL x1=que.front();que.pop();
        if(que.empty()) break;
        LL x2=que.front();
        cout<<"1 "<<x1<<" "<<x2<<"\n";
    }
return 0;
}