Codeforces 362C. Insertion Sort

DP预处理+枚举逆序对

C. Insertion Sort

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

Petya is a beginner programmer. He has already mastered the basics of the C++ language and moved on to learning algorithms. The first algorithm he encountered was insertion sort. Petya has already written the code that implements this algorithm and sorts the given integer zero-indexed array a of size n in the non-decreasing order.

for (int i = 1; i < n; i = i + 1)
{int j = i; while (j > 0 && a[j] < a[j - 1]){swap(a[j], a[j - 1]); // swap elements a[j] and a[j - 1]j = j - 1;}
}

Petya uses this algorithm only for sorting of arrays that are permutations of numbers from 0 to n - 1. He has already chosen the permutation he wants to sort but he first decided to swap some two of its elements. Petya wants to choose these elements in such a way that the number of times the sorting executes function swap, was minimum. Help Petya find out the number of ways in which he can make the swap and fulfill this requirement.

It is guaranteed that it's always possible to swap two elements of the input permutation in such a way that the number of swap function calls decreases.

Input

The first line contains a single integer n (2 ≤ n ≤ 5000) — the length of the permutation. The second line contains n different integers from0 to n - 1, inclusive — the actual permutation.

Output

Print two integers: the minimum number of times the swap function is executed and the number of such pairs (i, j) that swapping the elements of the input permutation with indexes i and j leads to the minimum number of the executions.

Sample test(s)

input

5
4 0 3 1 2

output

3 2

input

5
1 2 3 4 0

output

3 4

Note

In the first sample the appropriate pairs are (0, 3) and (0, 4).

In the second sample the appropriate pairs are (0, 4), (1, 4), (2, 4) and (3, 4).

/*** Created by ckboss on 14-9-4.*/import java.util.*;public class InsertionSort {public static void main(String[] args) {Scanner in = new Scanner(System.in);int n = in.nextInt();int[] a = new int[n + 10];int[][] dp = new int[n + 10][n + 10];for (int i = 1; i <= n; i++) {a[i] = in.nextInt();}for (int i = 1; i <= n; i++) {for (int j = 0; j < n; j++) {int t = 0;if (a[i] < j) t = 1;dp[i][j] = dp[i - 1][j] + t;}}int ISN = 0;for (int i = 1; i <= n; i++)ISN += i - 1 - dp[i][a[i]];int MinISN = (1 << 30);for (int i = 1; i <= n; i++) {for (int j = i + 1; j <= n; j++) {if (a[i] > a[j]) {int len = j - i - 1;int p = dp[j - 1][a[i]] - dp[i][a[i]];int q = dp[j - 1][a[j]] - dp[i][a[j]];int temp = ISN + 2 * (q - p) - 1;if (temp < MinISN)MinISN = temp;}}}int ans = 0;for (int i = 1; i <= n; i++) {for (int j = i + 1; j <= n; j++) {if (a[i] > a[j]) {int len = j - i - 1;int p = dp[j - 1][a[i]] - dp[i][a[i]];int q = dp[j - 1][a[j]] - dp[i][a[j]];int temp = ISN + 2 * (q - p) - 1;if (temp == MinISN)ans++;}}}System.out.println(MinISN + " " + ans);}
}

Codeforces 362C. Insertion Sort相关推荐

CodeForces - Insertion Sort(打表找规律)
题目链接:http://codeforces.com/gym/101955/problem/C Time limit:6.0 s Memory limit:1024 MB Problem Descri ...
CodeForces 362C
分析:首先我们要知道调用swap()函数的次数跟什么有关.可以观察发现在Insertion Sort里,当且仅当a[j](j∈[0,i)) > a[i]时会调用一次swap(),也就是说有多少个 ...
[Leetcode] Insertion Sort List
Sort a linked list using insertion sort. 虽然算法很简单,但是链表操作起来实正是烦啊,特别要注意各种边界条件. 1 /** 2 * Definition for ...
leetcode day2 -- Sort List Insertion Sort List
1.Sort List Sort a linked list in O(n log n) time using constant space complexity. 分析:对链表排序不是第一次见,但是 ...
[Leetcode]147. Insertion Sort List
Sort a linked list using insertion sort. 链表的插入排序思路,递归到链表尾,然后循环插入: 1 /** 2 * Definition for singly-l ...
LeetCode 147. Insertion Sort List 链表插入排序 C++/Java
LeetCode 147. Insertion Sort List 链表插入排序 C++/Java Sort a linked list using insertion sort. A graphic ...
Java实现插入排序及其优化 insertion sort
本文带来八大排序算法之插入排序. 插入排序(Insertion Sort)属于内部排序算法,是对于欲排序的元素以插入的方式找寻该元素的适当位置,以达到排序的目的. 插入排序基本思想: 把n个待排序的元 ...
python实现排序算法_python实现·十大排序算法之插入排序(Insertion Sort)
简介插入排序(Insertion Sort)是一种简单直观的排序算法.它的工作原理是:通过构建有序序列,对于未排序数据,在已排序序列中从后向前扫描,找到相应位置并插入. 算法实现步骤从第一个元素开 ...
c++Insertion Sort插入排序的实现算法(附完整源码)
C++Insertion Sort插入排序的实现算法 C++Insertion Sort插入排序的实现算法完整源码(定义,实现,main函数测试) C++Insertion Sort插入排序的实现算法 ...

Codeforces 362C. Insertion Sort

Codeforces 362C. Insertion Sort相关推荐

最新文章

热门文章