POJ 3270 - Cow Sorting【置换群】
来源:互联网 发布:nginx 配置ssl模块 编辑:程序博客网 时间:2024/05/17 06:42
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).
#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;}
0 0
- poj 3270 Cow Sorting(置换群)
- poj-3270-Cow Sorting-置换群
- poj 3270 Cow Sorting (置换群)
- poj 3270 Cow Sorting (置换群)
- POJ 3270-Cow Sorting(置换群)
- POJ Cow Sorting 3270【哈希表+置换群】
- POJ 3270 - Cow Sorting【置换群】
- POJ 3270 Cow Sorting(置换群)
- poj-3270 Cow Sorting 置换群
- POJ 3270 Cow Sorting (置换群)
- POJ 3270 Cow Sorting (置换)
- POJ Cow Sorting 置换
- poj 3270 Cow Sorting 置换群的应用
- poj 3270 Cow Sorting(初涉置换群)
- POJ 3270 Cow Sorting(置换群问题)
- poj Cow Sorting 3270 (置换群)好题
- 【POJ 3270】Cow Sorting(置换群排序)
- POJ 3270 Cow Sorting (置换群利用) 位置交换问题
- jq实现切换栏目显示效果
- ROS 教程之 vision : 用各种摄像头获取图像
- vs执行程序时提示无法启动程序,系统找不到指定的文件
- SYN Cookie的原理和实现
- 【细说PHP学习】第十七章 MySQL数据库概述
- POJ 3270 - Cow Sorting【置换群】
- NLP超级初步
- asm cli/sti 指令
- 根据泛型解析json字符串
- spring 配置文件属性
- 为什么Java byte 类型的取值范围是-128~127
- Java 编程下 Eclipse 如何设置单行代码显示的最大宽度
- 八款Java 开发者必备的工具
- 哈夫曼编码 (Huffman code)的实现,压缩、解压缩