POJ 3270 - Cow Sorting【置换群】
2015-08-05 16:46
169 查看
Cow Sorting
Time Limit: 2000MS Memory Limit: 65536KB
Description:
Farmer John's N (1 ≤ N ≤ 10,000) cows are lined up to be milked in the evening. Each cow has a unique "grumpiness" level in the range 1...100,000. Since grumpy cows are more likely to
damage FJ's milking equipment, FJ would like to reorder the cows in line so they are lined up in increasing order of grumpiness. During this process, the places of any two cows (not necessarily adjacent) can be interchanged. Since grumpy cows are harder to
move, it takes FJ a total of X+Y units of time to exchange two cows whose grumpiness levels are X and Y.
Please help FJ calculate the minimal time required to reorder the cows.
Input:
Line 1: A single integer: N.
Lines 2.. N+1: Each line contains a single integer: line i+1 describes the grumpiness of cow i.
Output
Line 1: A single line with the minimal time required to reorder the cows in increasing order of grumpiness.
Sample Input:
3
2
3
1
Sample Output:
7
Hint:
2 3 1 : Initial order.
2 1 3 : After interchanging cows with grumpiness 3 and 1 (time=1+3=4).
1 2 3 : After interchanging cows with grumpiness 1 and 2 (time=2+1=3).
Time Limit: 2000MS Memory Limit: 65536KB
Description:
Farmer John's N (1 ≤ N ≤ 10,000) cows are lined up to be milked in the evening. Each cow has a unique "grumpiness" level in the range 1...100,000. Since grumpy cows are more likely to
damage FJ's milking equipment, FJ would like to reorder the cows in line so they are lined up in increasing order of grumpiness. During this process, the places of any two cows (not necessarily adjacent) can be interchanged. Since grumpy cows are harder to
move, it takes FJ a total of X+Y units of time to exchange two cows whose grumpiness levels are X and Y.
Please help FJ calculate the minimal time required to reorder the cows.
Input:
Line 1: A single integer: N.
Lines 2.. N+1: Each line contains a single integer: line i+1 describes the grumpiness of cow i.
Output
Line 1: A single line with the minimal time required to reorder the cows in increasing order of grumpiness.
Sample Input:
3
2
3
1
Sample Output:
7
Hint:
2 3 1 : Initial order.
2 1 3 : After interchanging cows with grumpiness 3 and 1 (time=1+3=4).
1 2 3 : After interchanging cows with grumpiness 1 and 2 (time=2+1=3).
#include <stdio.h> #include <iostream> #include <string.h> #include <algorithm> #include <math.h> using namespace std; const int Max = 10010; int a[Max], sum, mins; struct Cow { int num; int sub; }cow[Max]; bool cmp(Cow a, Cow b) { return a.num < b.num; } int solve(int n) { int mem, ans = 0; for(int i = 1; i <= n; i++) { if(a[i] != 0) { int counts = 1; int id = cow[i].sub; mem = a[i]; if(a[id] < mem) mem = a[id]; while(id != i)///找出循环节长度 { counts++; id = cow[id].sub; if(a[id] < mem)///找出循环节中最小值mem mem = a[id]; } a[i] = 0; int sum1 = (counts - 2) * mem;///循环节最小值与循环节中元素交换 int sum2 = mem + (counts + 1) * mins;///数列中最小值与循环节中最小值交换后,再依次与循环节中元素交换 ans += sum1 < sum2 ? sum1 : sum2; } } return ans; } int main() { int n; while(~scanf("%d",&n)) { sum = 0; mins = 100000; for(int i = 1; i <= n; i++) { scanf("%d",&a[i]); sum += a[i]; cow[i].num = a[i]; cow[i].sub = i; if(mins > a[i])///找出数列中最小一个 mins = a[i]; } sort(cow+1,cow+1+n,cmp); printf("%d\n",solve(n)+sum); } return 0; }
相关文章推荐
- PHP-redis中文文档
- myeclipse2014破解过程
- _FILE_ _LINE_
- 条形码+二维码,开源利器ZXing
- 数据结构笔记之----查找
- spring 配置事务传播特性
- 如何使用软件的方法来查找一个QML的类型的所有的property
- 使用 Varnish 加速你的 Web 网站
- 关闭窗口后对父窗口的控制
- 非关系型数据库Redis学习(3)
- 集训第四周(高效算法设计)H题 (贪心)
- 信息管理比信息技术管理更宽泛
- some packet should been installed before QT on ubuntu 14.04
- yum命令找出命令属于哪个安装包
- 在vs2010中新建osg项目的环境设置
- asm cli/sti 指令
- Struts2框架流程概述
- Nginx服务器做负载均衡反向代理的超级攻略
- 判断checkbox是否选中并获取值
- windows 7旗舰版升级windows 10专业版,全过程