Codeforces Round #283 (Div. 2) C. 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.

题目大意：

一个二维的字符串，让你保证上一行的字典序比下一行小，如果不满足条件，就删除相应的列来使之满足。让你求出删除的最小的列数。

思路：只要对每一行遍历，相同的列数，上一行的数比下一行大，则删除该列。若下一行的比上一行的大，则跳出，察看下一行。

最后，在外层套一个for循环。

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cstdio>
#include <queue>
#include <vector>
using namespace std;
#define inf 0x7fffff
#define maxn 105


char arr[maxn][maxn];
int ans;
int n,m;
int vis[maxn];


int main(){


    scanf("%d%d",&n,&m);
  //  getchar();
    ans = 0;
    memset(vis,0,sizeof(vis));
    for(int i = 0; i < n; i++){
        scanf("%s",arr[i]);
    }


    if(n == 1){
        printf("0\n");
        return 0;
    }
    for(int k = 0; k < m ; k++){


        for(int i = 0; i < n - 1; i++){
            for(int j = 0; j <m ; j++){
                if(vis[j] == 0 && arr[i][j] > arr[i+1][j]){
                    ans ++;
                    vis[j] = 1;
                }else if(vis[j] == 0 && arr[i][j] < arr[i+1][j]){
                    break;
                }
            }
        }
    }
    printf("%d\n",ans);
    return 0;
}