CF_496C Removing Columns

C. Removing Columns

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

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.

Input

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.

Output

Print a single number — the minimum number of columns that you need to remove in order to make the table good.

Sample test(s)

input

1 10
codeforces

output

0

input

4 4
case
care
test
code

output

2

input

5 4
code
forc
esco
defo
rces

output

4

Note

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*m的字符矩阵，你可以将某一列整个删掉，剩下的部分继续组成字符矩阵。问最少删掉几列能使每一行都满足：下一行的字典序大于或等于上一行的字典序(这里字典序的比较方法与strcmp相同，但是两字符串位数一定是相同的)。

题解：

用一个数组去标记是否被删除，从左向右遍历就好，因为出错的只可能是当前列，所以可以适当剪枝。

代码实现：

#include <iostream>
#include <stdio.h>
#include <stdlib.h>
#include <cstring>
#define MAX_N 105

using namespace std;

char matrix[MAX_N][MAX_N];//储存字符矩阵
int show[MAX_N];//标记某一行是否被删掉
int times;//删除行数
int n,m;
bool m_remove(int x);//删除函数
bool m_com(int x);//比较函数
int main()
{
    times=0;
    scanf("%d%d",&n,&m);
    memset(show,1,sizeof(show));
    memset(matrix,0,sizeof(matrix));
    for(int i = 0; i < n; i++)
        scanf("%s",matrix[i]);
    //从左往右每一列遍历看是否能满足条件，注意边界为m
    for(int i = 0; i < m; i++)
    {
        if( ! m_com(i) )//不满足就删除，继续遍历
            m_remove(i);
    }
    printf("%d\n",times);
    return 0;
}
bool m_com(int x)
{
    for(int i = 0; i < n-1; i++)
    {
        bool flag= false;//设置标志
        for( int j = 0; j <= x; j++)
        {
            if( show[j] == 0)//删除略过
                continue;
            if( flag )//如果标记，直接跳出
                break;
            if( matrix[i][j] > matrix[i+1][j] )//不满足字典序
                return false;
            else if( matrix[i][j] < matrix[i+1][j] )//已经保证大于，标记！
                flag = true;
        }
    }
    return true;
}
bool m_remove(int x)
{
    show[x] = 0;
    times++;
    return true;
}