字典序最小问题Best Cow Line
来源:互联网 发布:centos 查看网络流量 编辑:程序博客网 时间:2024/05/17 09:03
#include <iostream>#include <string>using namespace std;int main(){ int N = 6; //cin >> N; //char s[] = "ACDBCB"; //char s[6] = {'A', 'C', 'D', 'B', 'C', 'B'}; //string s = "ACDBCB"; string s; cin >> s; int a = 0; int b = N - 1; while(a <= b) { bool left = false; for(int i = 0; a + i <= b; ++i) { if(s[a + i] < s[b - i]) { left = true; break; }else if(s[a + i] > s[b - i]) { left = false; break; } } if(left) { cout << s[a++]; }else { cout << s[b--]; } } cout << endl; return 0;}
- 字典序最小问题Best Cow Line
- 字典序最小问题——Best Cow Line
- POJ 3617 Best Cow Line(字典序最小问题)
- 043_字典序最小问题(best cow line)
- POJ No.3617-Best Cow Line(字典序最小问题)
- POJ3617 Best Cow Line (字典序最小问题)
- 字典序最小问题-贪心-Best Cow Line-POJ3617
- POJ 3617 Best Cow Line (字典序最小_贪心)
- POJ 3617 Best Cow Line [贪心] [字典序最小]
- POJ 3617 Best Cow Line(贪心+最小字典序)
- POJ3617 Best Cow Line(贪心,字典序最小)
- Best Cow Line(求最小字典数)
- POJ NO.3617 Best Cow Line(字典序最小问题)
- 2.2.3 字典序最小问题 -Best Cow Line(POJ 3617)
- 贪心算法-Best cow line-字典序问题
- poj 3617 Best Cow Line(取字典序最小的一种排序)
- 【OJ】贪心法(最小字典序)poj3617 Best Cow Line// acmclub 12701/12695
- POJ 3617Best Cow Line(字典序最小的字符串)
- GetBuffer与ReleaseBuffer的用法,CString剖析
- static_cast、dynamic_cast、reinterpret_cast和const_cast之间的区别
- MCS-51单片机的存储器组织结构
- 显示EAS标准单据自带kdtable(kdtEntry) 右键导出 excel菜单
- 关于Ubuntu的ip设置
- 字典序最小问题Best Cow Line
- nginx+uwsgi+django+linux搭建
- JAVA调用linux中的shell命令行的工具类
- Microchip中文资料下载
- 上传app store 应用指南链接--2
- Triangular Sums
- 安卓传感器api
- 红黑树----教你透彻了解红黑树
- 一个XMPP客户端需要实现的基本的XEP