Removing Columns - CodeForces 496 C 水题
来源:互联网 发布:java包装简历 编辑:程序博客网 时间:2024/05/17 04:04
You are given an n × m rectangular table consisting of lower case English letters. In one operation you can completely remove one column from the table. The remaining parts are combined forming a new table. For example, after removing the second column from the table
abcdedfghijk
we obtain the table:
acdefghjk
A table is called good if its rows are ordered from top to bottom lexicographically, i.e. each row is lexicographically no larger than the following one. Determine the minimum number of operations of removing a column needed to make a given table good.
The first line contains two integers — n and m (1 ≤ n, m ≤ 100).
Next n lines contain m small English letters each — the characters of the table.
Print a single number — the minimum number of columns that you need to remove in order to make the table good.
1 10codeforces
0
4 4casecaretestcode
2
5 4codeforcescodeforces
4
In the first sample the table is already good.
In the second sample you may remove the first and third column.
In the third sample you have to remove all the columns (note that the table where all rows are empty is considered good by definition).
Let strings s and t have equal length. Then, s is lexicographically larger than t if they are not equal and the character following the largest common prefix of s and t (the prefix may be empty) in s is alphabetically larger than the corresponding character of t.
题意:问至少删除几列,使得n个字符串按照字典序排列。
思路:从左到右扫,每次记录当前这个字符串的前i个字符是否和上一个相同,如果相同的话,那么就后面跟的必须字典序,否则的话就可以随意了。
AC代码如下:
#include<cstdio>#include<cstring>#include<iostream>#include<algorithm>#include<cmath>using namespace std;typedef long long ll;char s[1010][1010];int dp[2][1010];int main(){ int T,t,n,m,i,j,k,ans=0,a,b,c; bool flag; scanf("%d%d",&n,&m); for(i=1;i<=n;i++) scanf("%s",s[i]+1); for(i=2;i<=n;i++) dp[0][i]=1; a=0,b=1; for(j=1;j<=m;j++) { i=1; flag=true; while(i<=n) { dp[b][i]=0; for(i++;i<=n && dp[a][i]==1;i++) { if(s[i][j]==s[i-1][j]) dp[b][i]=1; else if(s[i][j]>s[i-1][j]) dp[b][i]=0; else { flag=false; break; } } if(!flag) break; } if(flag) swap(a,b); else ans++; } printf("%d\n",ans);}
- Removing Columns - CodeForces 496 C 水题
- CodeForces 496C Removing Columns
- codeforces 496C Removing Columns 贪心
- codeforces 496C Removing Columns (模拟,思维)
- Codeforces 496C Removing Columns(暴力)
- CodeForces 496C-- Removing Columns-暴力
- Codeforces 496 C Removing Columns【思维】
- codeforces #496C# Removing Columns
- Codeforces Round #283(div.2) 496C C. Removing Columns
- CF - 496C - Removing Columns
- C. Removing Columns
- Codeforces Round #283 div2 C (div1 A) 496C Removing Columns
- Codeforces Round #283 (Div. 2)---C. Removing Columns
- Codeforces Round #283 (Div. 2)——C. Removing Columns
- Codeforces Round #283 (Div. 2) C. Removing Columns
- Codeforces Round #283 (Div. 2) C. Removing Columns 模拟+构造
- Codeforces Round #283 (Div. 2)-C. Removing Columns
- CF 496C(Removing Columns-贪心取字典序)
- ArcGIS教程:Geostatistical Analyst 应用示例
- MYSQL select时锁定记录问题
- Android Studio http://schemas.android.com/apk/res/android “URI is not registered”解决方案
- 自定义ContentProvider以及ContentObserver的使用完整详细示例
- QAuth2认证 -- ( 不使用友盟等 )自己实现第三方登录(UIWebView)、微博分享、等其他操作
- Removing Columns - CodeForces 496 C 水题
- 早来的圣诞礼物!--android 逆向菜鸟速参手册完蛋版
- 客户端升级架构
- 【C语言】递归实现元素的全排列和子集
- Project Eluer - 20
- 04数据挖掘原理-数据分析 数据描述
- 第三十篇:Windbg的基础知识
- Wifi 资源整理
- 获取textarea中的换行和空格并转义显示在网页上