> 웹 프론트엔드 > HTML 튜토리얼 > Codeforces Round #283 (Div. 2)-C. Removing Columns_html/css_WEB-ITnose

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

WBOY
풀어 주다: 2016-06-24 11:52:10
원래의
1200명이 탐색했습니다.

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

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.




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





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 j="1;" if> s[j][i]) {                        del[i] = 1;                    }             }            if(!del[i]){                for(int j=1; j<n j if s flag int ans="0;" for i="0;" del printf return>  <br>  <br>  <p></p>  <p><br> </p>  <p><br> </p> </n></m></n></time.h></stdlib.h></math.h></string></map></set></queue></vector></algorithm></iostream></string.h></stdio.h>
로그인 후 복사
원천:php.cn
본 웹사이트의 성명
본 글의 내용은 네티즌들의 자발적인 기여로 작성되었으며, 저작권은 원저작자에게 있습니다. 본 사이트는 이에 상응하는 법적 책임을 지지 않습니다. 표절이나 침해가 의심되는 콘텐츠를 발견한 경우 admin@php.cn으로 문의하세요.
인기 튜토리얼
더>
최신 다운로드
더>
웹 효과
웹사이트 소스 코드
웹사이트 자료
프론트엔드 템플릿