矩阵中,要求每行每列的和值都为非负值。
操作:对一行/一列 取反
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <string>
#include <iostream>
#include <algorithm>
#include <sstream>
#include <cmath>
using namespace std;
#include <queue>
#include <stack>
#include <vector>
#include <deque>
#define cler(arr, val) memset(arr, val, sizeof(arr))
#define FOR(i,a,b) for(int i=a;i<=b;i++)
#define IN freopen ("in.txt" , "r" , stdin);
#define OUT freopen ("out.txt" , "w" , stdout);
typedef long long LL;
const int MAXN = 160;
const int MAXM = 6000010;
const int INF = 0x3f3f3f3f;
const LL mod = 10007;
const double eps= 1e-8;
#define lson l,m, rt<<1
#define rson m+1,r,rt<<1|1
int n,m;
int mp[MAXN][MAXN],r[MAXN],c[MAXN];
bool numr[MAXN],numc[MAXN];
int input()
{
cler(numr,false),cler(numc,false);
cler(c,0),cler(r,0);
cin>>n>>m;
for(int i=1;i<=n;i++)
for(int j=1;j<=m;j++)
{
cin>>mp[i][j];
c[i]+=mp[i][j];
r[j]+=mp[i][j];
}
}
int solve()
{
bool flag=true;
while(flag)
{
flag=false;
for(int i=1;i<=n&&!flag;i++)
{
if(c[i]<0)
{
for(int j=1;j<=m;j++)
r[j]-=2*mp[i][j],mp[i][j]*=-1;
numc[i]=!numc[i];
c[i]*=-1;
flag=true;
}
}
for(int j=1;j<=m&&!flag;j++)
{
if(r[j]<0)
{
for(int i=1;i<=n;i++)
c[i]-=2*mp[i][j],mp[i][j]*=-1;
numr[j]=!numr[j];
r[j]*=-1;
flag=true;
}
}
}
int ans[2]={0};
for(int i=1;i<=n;i++)
if(numc[i]) ans[0]++;
for(int i=1;i<=m;i++)
if(numr[i]) ans[1]++;
cout<<ans[0];
for(int i=1;i<=n;i++)
if(numc[i]) cout<<" "<<i;
cout<<endl<<ans[1];
for(int i=1;i<=m;i++)
if(numr[i]) cout<<" "<<i;
}
int main()
{
input();
solve();
return 0;
}