POJ 3671 Dining Cows 简单DP
来源:互联网 发布:apache ant 1.7.0 编辑:程序博客网 时间:2024/06/05 17:52
http://poj.org/problem?id=3671
简单动态规划
opt[i][0]第i个数后1的个数;opt[i][1] 第i个数前2的个数
状态方程
Description
The cows are so very silly about their dinner partners. They have organized themselves into two groups (conveniently numbered 1 and 2) that insist upon dining together in order, with group 1 at the beginning of the line and group 2 at the end. The trouble starts when they line up at the barn to enter the feeding area.
Each cow i carries with her a small card upon which is engraved Di (1 ≤ Di ≤ 2) indicating her dining group membership. The entire set of N (1 ≤ N ≤ 30,000) cows has lined up for dinner but it's easy for anyone to see that they are not grouped by their dinner-partner cards.
FJ's job is not so difficult. He just walks down the line of cows changing their dinner partner assignment by marking out the old number and writing in a new one. By doing so, he creates groups of cows like 112222 or 111122 where the cows' dining groups are sorted in ascending order by their dinner cards. Rarely he might change cards so that only one group of cows is left (e.g., 1111 or 222).
FJ is just as lazy as the next fellow. He's curious: what is the absolute minimum number of cards he must change to create a proper grouping of dining partners? He must only change card numbers and must not rearrange the cows standing in line.
Input
* Line 1: A single integer: N
* Lines 2..N+1: Line i+1 describes cow i's dining preference with a single integer: Di
Output
* Line 1: A single integer that is the minimum number of cards Farmer John must change to assign the cows to eating groups as described.
Sample Input
72111221
Sample Output
2
47ms代码
稍微修改优化后代码 16ms
- POJ 3671 Dining Cows 简单DP
- poj 3671 Dining Cows(dp)
- POJ 3671 Dining Cows (DP)
- poj 3671 Dining Cows
- POJ 3671 Dining Cows
- POJ 3671 Dining Cows
- poj 3671 Dining Cows 动态规划
- poj 2181 Jumping Cows 【简单DP】
- POJ 3186Treats for the Cows 简单dp
- poj 2181 Jumping Cows DP
- POJ 2181 JUMPING COWS(DP)
- POJ 3281 - Dining 简单构图最大流..
- Dining POJ
- Dining POJ
- Dining POJ
- POJ 3186 Treats for the Cows 详解 (简单区间DP)
- POJ 2181Jumping Cows 动态规划DP
- poj 2430 Lazy Cows 状压dp
- JSP基础知识
- smslib 端口释放,重复调用后,抛出异常
- C# 4.0新特性-"协变"与"逆变"以及背后的编程思想
- 基于嵌入式Cramfs 的根文件系统配置新方法
- 关于物联网和云计算
- POJ 3671 Dining Cows 简单DP
- Android AIDL(Android Interface Definition Language)介绍
- javax.servlet.ServletRequest 的getAttribute(String name)与getParmeter(String name)的区别
- 代替桌面工具 10款最给力的Web开发与设计工具
- DirectShow 通过IAMVideoProcAmp接口设置亮度、对比度等属性 (not ISpecifyPropertyPages接口 )
- JNI(Java Native Interface)的使用
- DataSet 转换为Json
- 新博客
- C# 集合类 Array Arraylist List Hashtable Dictionary Stack Queue