Codeforces Round #283 (Div. 2)-C. Removing Columns_html/css_WEB-ITnose

Removing Columns

time limit per test

memory limit per test

input

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

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.

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 10codeforces

output

input

4 4casecaretestcode

output

input

5 4codeforcescodeforces

output

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.

div+css3阶梯分页样式

div+css3阶梯分页样式

84

查看详情

分析：也是基于暴力，中间有了细节的处理。

AC代码：

#include <stdio.h>#include <string.h>#include <iostream>#include <algorithm>#include <vector>#include <queue>#include <set>#include <map>#include <string>#include <math.h>#include <stdlib.h>#include <time.h>using namespace std;#define INF 0x7fffffffstring s[105];                  //mapint flag[105], del[105];        //del[]是否删除某列，flag[]是否反序int main(){    #ifdef sxk        freopen("in.txt","r",stdin);    #endif    int n, m;    while(scanf("%d%d",&n, &m)!=EOF)    {        memset(flag, 0, sizeof(flag));        memset(del, 0, sizeof(del));        for(int i=0; i<n; i++)            cin >> s[i];        for(int i=0; i<m; i++){            for(int j=1; j<n; j++){                if(!flag[j])                    if(s[j-1][i] > s[j][i]) {                        del[i] = 1;                    }             }            if(!del[i]){                for(int j=1; j<n; j++)                    if(s[j-1][i] < s[j][i]) {                        flag[j] = 1;                    }            }        }        int ans = 0;        for(int i=0; i<m; i++) ans += del[i];        printf("%d\n", ans);    }    return 0;}