Jump and Jump...
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 664 Accepted Submission(s): 370
#include <iostream>
#include <cstring>
#include <algorithm>
using namespace std;
int T,sum[105],a,b,c,n,i,j,temp[105];
int main()
{
cin >> T;
while(T--)
{
cin >> n;
memset(sum,0,sizeof(int)*105);
memset(temp,0,sizeof(int)*106);
for(i = 0;i < n;i++)
{
cin >> a >>b >> c;
sum[i] = max(max(a,b),c);
temp[i] = sum[i];
}
for(i = 0;i < n;i++)
for(j = 0;j < n - 1 - i;j++)
if(sum[j] < sum[j+1])
{
sum[j]+=sum[j + 1];
sum[j+1] = sum[j] - sum[j+1];
sum[j] = sum[j] - sum[j+1];
}
for(i = 0;i < n;i++)
for(j = 0;j < n;j++)
if(sum[j] == temp[i])
if(!i) cout << j+1;
else cout << " " << j+1;
cout << endl;
}
return 0 ;
}