POJ 3623Best Cow Line, Gold
来源:互联网 发布:网络凶杀2 编辑:程序博客网 时间:2024/05/17 10:03
Description
FJ is about to take his N (1 ≤ N ≤ 30,000) cows to the annual"Farmer of the Year" competition. In this contest every farmer arranges his cows in a line and herds them past the judges.
The contest organizers adopted a new registration scheme this year: simply register the initial letter of every cow in the order they will appear (i.e., If FJ takes Bessie, Sylvia, and Dora in that order he just registers BSD). After the registration phase ends, every group is judged in increasing lexicographic order according to the string of the initials of the cows' names.
FJ is very busy this year and has to hurry back to his farm, so he wants to be judged as early as possible. He decides to rearrange his cows, who have already lined up, before registering them.
FJ marks a location for a new line of the competing cows. He then proceeds to marshal the cows from the old line to the new one by repeatedly sending either the first or last cow in the (remainder of the) original line to the end of the new line. When he's finished, FJ takes his cows for registration in this new order.
Given the initial order of his cows, determine the least lexicographic string of initials he can make this way.
Input
* Line 1: A single integer: N
* Lines 2..N+1: Line i+1 contains a single initial ('A'..'Z') of the cow in the ith position in the original line
Output
The least lexicographic string he can make. Every line (except perhaps the last one) contains the initials of 80 cows ('A'..'Z') in the new line.
Sample Input
6ACDBCB
Sample Output
ABCBCD
给出n个字母,每次只能从最前或最后取字母,问最后字典序最小是多少。
把原串反转加到后面去,求一遍后缀数组,然后模拟前后取,选小的即可。
#include<set>#include<map>#include<ctime>#include<cmath>#include<stack>#include<queue>#include<bitset>#include<cstdio>#include<string>#include<cstring>#include<iostream>#include<algorithm>#include<functional>#define rep(i,j,k) for (int i = j; i <= k; i++)#define per(i,j,k) for (int i = j; i >= k; i--)#define loop(i,j,k) for (int i = j;i != -1; i = k[i])#define lson x << 1, l, mid#define rson x << 1 | 1, mid + 1, r#define fi first#define se second#define mp(i,j) make_pair(i,j)#define pii pair<string,string>using namespace std;typedef long long LL;const int low(int x) { return x&-x; }const double eps = 1e-8;const int INF = 0x7FFFFFFF;const int mod = 1e8;const int N = 5e5 + 10;const int read(){char ch = getchar();while (ch<'0' || ch>'9') ch = getchar();int x = ch - '0';while ((ch = getchar()) >= '0'&&ch <= '9') x = x * 10 + ch - '0';return x;}struct Sa{char s[N];int rk[2][N], sa[N], h[N], w[N], now, n;int rmq[N][20], lg[N];bool GetS(){n = read();rep(i, 1, n) scanf("%s", s + i);s[n + 1] = 1;rep(i, 1, n) s[n + n + 2 - i] = s[i];n = n + n + 1;return true;}void getsa(int z, int &m){int x = now, y = now ^= 1;rep(i, 1, z) rk[y][i] = n - i + 1;for (int i = 1, j = z; i <= n; i++)if (sa[i] > z) rk[y][++j] = sa[i] - z;rep(i, 1, m) w[i] = 0;rep(i, 1, n) w[rk[x][rk[y][i]]]++;rep(i, 1, m) w[i] += w[i - 1];per(i, n, 1) sa[w[rk[x][rk[y][i]]]--] = rk[y][i];for (int i = m = 1; i <= n; i++){int *a = rk[x] + sa[i], *b = rk[x] + sa[i - 1];rk[y][sa[i]] = *a == *b&&*(a + z) == *(b + z) ? m - 1 : m++;}}void getsa(int m){//n = strlen(s + 1);rk[1][0] = now = sa[0] = s[0] = 0;rep(i, 1, m) w[i] = 0;rep(i, 1, n) w[s[i]]++;rep(i, 1, m) rk[1][i] = rk[1][i - 1] + (bool)w[i];rep(i, 1, m) w[i] += w[i - 1];rep(i, 1, n) rk[0][i] = rk[1][s[i]];rep(i, 1, n) sa[w[s[i]]--] = i;rk[1][n + 1] = rk[0][n + 1] = 0;//多组的时候容易出bugfor (int x = 1, y = rk[1][m]; x <= n && y <= n; x <<= 1) getsa(x, y);for (int i = 1, j = 0; i <= n; h[rk[now][i++]] = j ? j-- : j){if (rk[now][i] == 1) continue;int k = n - max(sa[rk[now][i] - 1], i);while (j <= k && s[sa[rk[now][i] - 1] + j] == s[i + j]) ++j;}}void getrmq(){h[n + 1] = h[1] = lg[1] = 0;rep(i, 2, n) rmq[i][0] = h[i], lg[i] = lg[i >> 1] + 1;for (int i = 1; (1 << i) <= n; i++){rep(j, 2, n){if (j + (1 << i) > n + 1) break;rmq[j][i] = min(rmq[j][i - 1], rmq[j + (1 << i - 1)][i - 1]);}}}int lcp(int x, int y){int l = min(rk[now][x], rk[now][y]) + 1, r = max(rk[now][x], rk[now][y]);return min(rmq[l][lg[r - l + 1]], rmq[r - (1 << lg[r - l + 1]) + 1][lg[r - l + 1]]);}void work(){GetS();getsa(256);int tot = 0;for (int l = 1, r = n / 2; l <= r;){if (rk[now][l] < rk[now][n + 1 - r]) printf("%c", s[l++]);else printf("%c", s[r--]);if (++tot % 80 == 0) putchar(10);}putchar(10);}}sa;int main(){sa.work();return 0;}
- POJ-3623-Best Cow Line, Gold
- poj 3623 Best Cow Line, Gold
- POJ 3623 Best Cow Line, Gold(模拟)
- POJ 3623 Best Cow Line, Gold(模拟)
- poj 3623 Best Cow Line, Gold(贪心)
- POJ 3623Best Cow Line, Gold
- poj 3623 Best Cow Line, Gold 暴力枚举
- POJ 3623 Best Cow Line, Gold(贪心)
- [贪心+后缀数组] poj 3623 Best Cow Line, Gold
- POJ 3623 Best Cow Line, Gold(贪心)
- |Poj 3623|后缀数组|Best Cow Line, Gold
- PKU 3623 Best Cow Line, Gold
- POJ3623 Best Cow Line,Gold
- POJ3623-Best Cow Line, Gold
- POJ 3623 Best Cow Line
- POJ 题目3623 Best Cow Line, Gold(后缀数组rank简单应用)
- poj Best Cow Line
- POJ-Best Cow Line
- 学习笔记-《零基础学习HTML5—html+css基础 》1.前端认知
- HTML5 安全问题解析
- deep learning---SAE(stacked autoencoder)
- 不靠谱的神经想法
- hibernate 采用映射文件配置
- POJ 3623Best Cow Line, Gold
- 穿上华丽的外衣——JavaScript对象之旅(码神学习第二十四天)
- 数据库的几个概念:主键,外键,索引,唯一索引
- python opencv 获取程序执行时间
- oracle安装界面乱码以及不能在开始菜单和桌面创建菜单项解决方案
- 例题5-7 UVa136 Ugly Numbers(STL:priority_queue)
- const的声明 指针
- Poisson Image Editing & Texture Based Terrain Synthesis
- MultiAutoCompleteTextView多个自动补全