[置换群] POJ 3270

题意

交换牛使他们的脾气指数是上升的,任意交换两个牛的位置花费两个牛脾气的和

思路

1. 每次用该循环里脾气最小的牛和其他牛交换好位置
2. 用其他循环里脾气小的牛来和该循环里所有的牛交换位置(比较难想hhh

代码

// https://www.cnblogs.com/kuangbin/archive/2012/09/03/2669013.html
#include <algorithm>
#include <bits/stdc++.h>
#include <cstdio>
#include <cstring>
#include <iostream>

using namespace std;
typedef long long ll;

const int INF = 0x7f7f7f7f;
const int maxn = 10000 + 10;

int t, MIN;
struct Node {
    int id, num;

    bool operator< ( const Node &rhs ) const { return num < rhs.num; }
} node[ maxn ];

bool vis[ maxn ];
void solve () {
    int ans = 0;
    memset ( vis, 0, sizeof ( vis ) );

    for ( int i = 1; i <= t; ++i ) {
        if ( !vis[ i ] ) {
            vis[ i ] = true;
            int sum = node[ i ].num, l = node[ i ].id;
            int mi = node[ i ].num;
            int cnt = 1;
            while ( l != i ) {
                if ( node[ l ].num < mi )
                    mi = node[ l ].num;
                ++cnt;
                sum += node[ l ].num;
                vis[ l ] = true;
                l = node[ l ].id;
            }
            ans += min ( sum + ( cnt - 2 ) * mi, sum + mi + ( cnt + 1 ) * MIN );
        }
    }
    printf ( "%d\n", ans );
}

int main () {
#ifdef LOCAL
    freopen ( "in", "r", stdin );
    // freopen("out","w",stdout);
#endif
    while ( ~scanf ( "%d", &t ) ) {
        for ( int i = 1; i <= t; ++i ) {
            node[ i ].id = i;
            scanf ( "%d", &node[ i ].num );
        }
        sort ( node + 1, node + t + 1 );
        MIN = node[ 1 ].num;
        solve ();
    }

    return 0;
}