Codeforces 433C Ryouko's Memory Note
来源:互联网 发布:什么软件可以制定计划 编辑:程序博客网 时间:2024/06/06 03:34
Ryouko is an extremely forgetful girl, she could even forget something that has just happened. So in order to remember, she takes a notebook with her, called Ryouko's Memory Note. She writes what she sees and what she hears on the notebook, and the notebook became her memory.
Though Ryouko is forgetful, she is also born with superb analyzing abilities. However, analyzing depends greatly on gathered information, in other words, memory. So she has to shuffle through her notebook whenever she needs to analyze, which is tough work.
Ryouko's notebook consists of n pages, numbered from 1 to n. To make life (and this problem) easier, we consider that to turn from page x to page y, |x - y| pages should be turned. During analyzing, Ryouko needs m pieces of information, the i-th piece of information is on page ai. Information must be read from the notebook in order, so the total number of pages that Ryouko needs to turn is .
Ryouko wants to decrease the number of pages that need to be turned. In order to achieve this, she can merge two pages of her notebook. If Ryouko merges page x to page y, she would copy all the information on page x to y (1 ≤ x, y ≤ n), and consequently, all elements in sequence a that was x would become y. Note that x can be equal to y, in which case no changes take place.
Please tell Ryouko the minimum number of pages that she needs to turn. Note she can apply the described operation at most once before the reading. Note that the answer can exceed 32-bit integers.
The first line of input contains two integers n and m (1 ≤ n, m ≤ 105).
The next line contains m integers separated by spaces: a1, a2, ..., am (1 ≤ ai ≤ n).
Print a single integer — the minimum number of pages Ryouko needs to turn.
4 61 2 3 4 3 2
3
10 59 4 3 8 8
6
In the first sample, the optimal solution is to merge page 4 to 3, after merging sequence a becomes {1, 2, 3, 3, 3, 2}, so the number of pages Ryouko needs to turn is |1 - 2| + |2 - 3| + |3 - 3| + |3 - 3| + |3 - 2| = 3.
In the second sample, optimal solution is achieved by merging page 9 to 4.
使用vector记录一个数两边的数字,然后把这些数字排序,选中间的那个当做修改后的值,有两个地方需要注意,一个是push的时候如果有几个连续相同的数,这些数是不能放进对应的vector中的,第二个是下边枚举时如果用m会超时,所以记录一下页数的最大值,用页数枚举。
#include <cstdio>#include <iostream>#include <algorithm>#include <vector>using namespace std;const int maxn = 100000 + 100;vector <int> v[maxn];int arr[maxn];int main(){ int n, m; long long temp = 0, _min, _beg = 0; int _max = 0; scanf("%d%d", &n, &m); for (int i = 0; i < m; i++){ scanf("%d", &arr[i]); _max = max(arr[i], _max); if (i != 0 && arr[i] != arr[i - 1]){ v[arr[i - 1]].push_back(arr[i]); v[arr[i]].push_back(arr[i - 1]); _beg += abs(arr[i] - arr[i- 1]); } } _min = temp = _beg; int rev, _size; vector <int> k; for (int i = 1; i <= _max; i++){ temp = _beg; _size = v[i].size(); if (_size == 0) continue; k = v[i]; sort(k.begin(), k.end()); rev = k[_size / 2]; for (int j = 0; j < _size; j++) temp += (abs(rev - k[j]) - abs(i - k[j])); _min = min(temp, _min); } cout << _min << endl; return 0;}
- Codeforces 433C Ryouko's Memory Note
- Codeforces 433 C. Ryouko's Memory Note
- Codeforces 433 C Ryouko's Memory Note
- Codeforces 433C Ryouko's Memory Note
- codeforces #433C Ryouko's Memory Note
- CodeForces 433C Ryouko's Memory Note(暴力加中位数)
- codeforces #433C Ryouko's Memory Note(瞎搞)
- CodeForces 433C Ryouko's Memory Note (数学)
- CF 433C Ryouko's Memory Note
- C. Ryouko's Memory Note
- Codeforces Round #248 (Div. 2) C.Ryouko's Memory Note
- Codeforces Round #248 (Div. 2) C. Ryouko's Memory Note
- Codeforces Round #248 (Div. 2) C - Ryouko's Memory Note
- Codeforces RoundC. Ryouko's Memory Note
- CF 248 C. Ryouko's Memory Note
- Codeforces433 C Ryouko’s Memory Note
- Ryouko's Memory Note(书本翻页)
- codeforces248(div1) A. Ryouko's Memory Note
- 使用Unity3D的50个技巧:Unity3D最佳实践
- C# 中 Convert 与 Parse 区别
- unity 自带样式名称(string to GUIStyle)
- 别人珍惜了你,你也应该去珍惜别人。
- 搭建spring框架
- Codeforces 433C Ryouko's Memory Note
- Qt自动补全(QCompleter或QListView)
- 机器学习做二元分类问题(二)
- VS2015和QT5.5项目出现的诡异错误(LNK2001和LNK09)的解决办法
- struct tm 和 time_t 时间和日期的使用方法
- 跟vczh看实例学编译原理——零:序言
- Oracle自动启动改为手动启动(以免不用时占内存)
- scala-41:List继承体系实现内幕和方法操作源码揭秘
- 跟vczh看实例学编译原理——一:Tinymoe的设计哲学