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
abcd edfg hijk
we obtain the table:
acd efg hjk
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 andm (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 10 codeforces
0
4 4 case care test code
2
5 4 code forc esco defo rces
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 islexicographically larger thant if they are not equal and the character following the largest common prefix ofs andt (the prefix may be empty) ins is alphabetically larger than the corresponding character oft.
题目链接:http://codeforces.com/problemset/problem/496/C
题目大意:给出一个n*m的矩阵,求删除最少的列数使得其从上往下行字典序递增
题目分析:按照先列后行的顺序根据行来判断,当前行比上一行小的话该列删除cnt+1,当前行比上一行大的话对这一行标记,假设这是第i行第j列,则第j + 1列到第m列的前i行的字符可以任意,因为第j列的前i行已经将字典序确定了,相等的话就不标记
#include <cstdio>
#include <cstring>
char s[105][105];
bool ok[105];
int n, m;
int main()
{
int cnt = 0, flag;
memset(ok, false, sizeof(ok));
scanf("%d %d", &n, &m);
for(int i = 0; i < n; i++)
scanf("%s", s[i]);
for(int j = 0; j < m; j++)
{
flag = true;
for(int i = 1; i < n; i++)
{
if(s[i - 1][j] > s[i][j] && !ok[i])
{
flag = false;
cnt++;
break;
}
}
if(flag)
for(int i = 1; i < n; i++)
if(s[i - 1][j] < s[i][j])
ok[i] = true;
}
printf("%d\n", cnt);
}