一道在CF上WA了9次才AC的A题题目与10个版本的代码代码

题目（题目链接：https://codeforces.com/problemset/problem/733/A）：

A. Grasshopper And the String

time limit per test:1 second

memory limit per test:256 megabytes

input:standard input

output:standard output

One day, the Grasshopper was jumping on the lawn and found a piece of paper with a string. Grasshopper became interested what is the minimum jump ability he should have in order to be able to reach the far end of the string, jumping only on vowels of the English alphabet. Jump ability is the maximum possible length of his jump.

Formally, consider that at the begginning the Grasshopper is located directly in front of the leftmost character of the string. His goal is to reach the position right after the rightmost character of the string. In one jump the Grasshopper could jump to the right any distance from 1 to the value of his jump ability.

The picture corresponds to the first example.

The following letters are vowels: 'A', 'E', 'I', 'O', 'U' and 'Y'.

Input

The first line contains non-empty string consisting of capital English letters. It is guaranteed that the length of the string does not exceed 100.

Output

Print single integer a — the minimum jump ability of the Grasshopper (in the number of symbols) that is needed to overcome the given string, jumping only on vowels.

Examples

input

ABABBBACFEYUKOTT

output

input

AAA

output

版本1代码：

 #include <bits/stdc++.h>

 using namespace std;

 int main()

 {

     char Str[];

     int index, ans;

     while( ~scanf( "%s", Str ) )

     {

         index = ans = ;

         for( int i = ; Str[i] != '\0'; i ++ )///'A', 'E', 'I', 'O', 'U' and 'Y'.

         {

             index ++;

             if( Str[i] == 'A' || Str[i] == 'E' || Str[i] == 'I' || Str[i] == 'O' || Str[i] == 'U' || Str[i] == 'Y' )

             {

                 ans = index >= ans ? index : ans;

                 index = ;

             }

         }

         //ans = index >= ans ? index : ans;

         printf( "%d\n", ans );

     }

     return ;

 }

版本2代码：

 #include <bits/stdc++.h>

 using namespace std;

 int main()

 {

     char Str[];

     int index, ans;

     while( ~scanf( "%s", Str ) )

     {

         index = ans = ;

         if( strlen(Str) ==  && !( Str[] == 'A' || Str[] == 'E' || Str[] == 'I' || Str[] == 'O' || Str[] == 'U' || Str[] == 'Y' ) )

         {

             printf( "2\n" );

             break;

         }

         for( int i = ; Str[i] != '\0'; i ++ )///'A', 'E', 'I', 'O', 'U' and 'Y'.

         {

             index ++;

             if( Str[i] == 'A' || Str[i] == 'E' || Str[i] == 'I' || Str[i] == 'O' || Str[i] == 'U' || Str[i] == 'Y' )

             {

                 ans = index >= ans ? index : ans;

                 index = ;

             }

         }

         ans = index >= ans ? index : ans;

         printf( "%d\n", ans );

     }

     return ;

 }

版本3代码：

 #include <bits/stdc++.h>

 using namespace std;

 int main()

 {

     char Str[];

     int index, ans;

     bool flag;

     while( ~scanf( "%s", Str ) )

     {

         flag = false;

         index = ans = ;

         if( strlen(Str) ==  && !( Str[] == 'A' || Str[] == 'E' || Str[] == 'I' || Str[] == 'O' || Str[] == 'U' || Str[] == 'Y' ) )

         {

             printf( "2\n" );

             break;

         }

         for( int i = ; Str[i] != '\0'; i ++ )///'A', 'E', 'I', 'O', 'U' and 'Y'.

         {

             index ++;

             if( Str[i] == 'A' || Str[i] == 'E' || Str[i] == 'I' || Str[i] == 'O' || Str[i] == 'U' || Str[i] == 'Y' )

             {

                 ans = index >= ans ? index : ans;

                 index = ;

                 flag = true;

             }

         }

         if( strlen(Str) >  && !flag )

         {

             printf( "%d\n", strlen(Str) +  );

             break;

         }

         ans = index >= ans ? index : ans;

         printf( "%d\n", ans );

     }

     return ;

 }

版本4代码：

 #include <bits/stdc++.h>

 using namespace std;

 int main()

 {

     char Str[];

     int vis[];

     int index, ans, last;

     while( ~scanf( "%s", Str ) )

     {

         last = -;

         memset( vis, , sizeof(vis) );

         index = ;

         ans = ;

         for( int i = ; Str[i] != '\0'; i ++ )///'A', 'E', 'I', 'O', 'U' and 'Y'.

         {

             index ++;

             if( Str[i] == 'A' || Str[i] == 'E' || Str[i] == 'I' || Str[i] == 'O' || Str[i] == 'U' || Str[i] == 'Y' )

             {

                 vis[index] = i + ;

                 last = i;

             }

         }

         int tmp = ;

         for( int i = ; i < index; i ++ )

         {

             if(vis[i])

             {

                 ///printf( "%d ", vis[i] );

                ans = max( vis[i] - tmp, ans );

                tmp = vis[i];

             }

         }

         int L = strlen(Str);

         ans = max( L - last, ans );

         ///printf( "last = %d,\tL = %d\n", last, L );

         printf( "%d\n", ans );

     }

     return ;

 }

版本5代码：

 #include <bits/stdc++.h>

 using namespace std;

 int main()

 {

     char Str[];

     int vis[];

     int index, ans, last;

     while( ~scanf( "%s", Str ) )

     {

         last = -;

         memset( vis, , sizeof(vis) );

         index = ;

         ans = ;

         for( int i = ; Str[i] != '\0'; i ++ )///'A', 'E', 'I', 'O', 'U' and 'Y'.

         {

             index ++;

             if( Str[i] == 'A' || Str[i] == 'E' || Str[i] == 'I' || Str[i] == 'O' || Str[i] == 'U' || Str[i] == 'Y' )

             {

                 vis[index] = i + ;

                 last = i;

             }

         }

         int tmp = ;

         for( int i = ; i < index; i ++ )

         {

             if(vis[i])

             {

                 //printf( "%d ", vis[i] );

                 ans = max( vis[i] - tmp, ans );

                 tmp = vis[i];

             }

         }

         int L = strlen(Str);

         ans = max( L - last, ans );

         //printf( "\nlast = %d,\tL = %d\n", last, L );

         printf( "%d\n", ans );

     }

     return ;

 }

版本6代码：

 #include <bits/stdc++.h>

 using namespace std;

 int main()

 {

     char Str[];

     int vis[];

     int index, ans, last;

     while( ~scanf( "%s", Str ) )

     {

         last = -;

         memset( vis, , sizeof(vis) );

         index = ;

         ans = ;

         for( int i = ; Str[i] != '\0'; i ++ )///'A', 'E', 'I', 'O', 'U' and 'Y'.

         {

             index ++;

             if( Str[i] == 'A' || Str[i] == 'E' || Str[i] == 'I' || Str[i] == 'O' || Str[i] == 'U' || Str[i] == 'Y' )

             {

                 vis[index] = i + ;

                 last = vis[index];

             }

         }

         int tmp = ;

         for( int i = ; i < index; i ++ )

         {

             if(vis[i])

             {

                 //printf( "%d ", vis[i] );

                 ans = max( vis[i] - tmp, ans );

                 tmp = vis[i];

             }

         }

         int L = strlen(Str);

         ans = max( L - last, ans );

         //printf( "\nlast = %d,\tL = %d\n", last, L );

         printf( "%d\n", ans );

     }

     return ;

 }

版本7代码：

 #include <bits/stdc++.h>

 using namespace std;

 int main()

 {

     char Str[];

     int vis[];

     int index, ans, last, Tmp;

     while( ~scanf( "%s", Str ) )

     {

         last = -;

         memset( vis, , sizeof(vis) );

         index = ;

         ans = ;

         for( int i = ; Str[i] != '\0'; i ++ )///'A', 'E', 'I', 'O', 'U' and 'Y'.

         {

             index ++;

             if( Str[i] == 'A' || Str[i] == 'E' || Str[i] == 'I' || Str[i] == 'O' || Str[i] == 'U' || Str[i] == 'Y' )

             {

                 vis[index] = i + ;

                 last = i;

             }

         }

         int tmp = ;

         for( int i = ; i <= index; i ++ )

         {

             if(vis[i])

             {

                 ///printf( "%d ", vis[i] );

                 ans = max( vis[i] - tmp, ans );

                 tmp = vis[i];

             }

         }

         int L = strlen(Str);

         ans = max( L - last, ans );

         ///printf( "\nlast = %d,\tL = %d\n", last, L );

         printf( "%d\n", ans );

     }

     return ;

 }

版本8代码：

 #include <bits/stdc++.h>

 using namespace std;

 int main()

 {

     char Str[];

     int vis[];

     int index, ans, last;

     while( ~scanf( "%s", Str ) )

     {

         last = -;

         memset( vis, , sizeof(vis) );

         index = ;

         ans = ;

         for( int i = ; Str[i] != '\0'; i ++ )///'A', 'E', 'I', 'O', 'U' and 'Y'.

         {

             index ++;

             if( Str[i] == 'A' || Str[i] == 'E' || Str[i] == 'I' || Str[i] == 'O' || Str[i] == 'U' || Str[i] == 'Y' )

             {

                 vis[index] = i + ;

                 last = i;

             }

         }

         int tmp = ;

         for( int i = ; i <= index; i ++ )

         {

             if(vis[i])

             {

                 //printf( "%d ", vis[i] );

                 ans = max( vis[i] - tmp, ans );

                 tmp = vis[i];

             }

         }

         int L = strlen(Str);

         ans = max( L - last, ans );

         ans = max( vis[ index -  ] - vis[ index -  ], ans );

         //printf( "\nlast = %d,\tL = %d,\tindex = %d\n", last, L,index );

         printf( "%d\n", ans );

     }

     return ;

 }

版本9代码：

 #include <bits/stdc++.h>

 using namespace std;

 int main()

 {

     char Str[];

     int vis[];

     int index, ans, last;

     while( ~scanf( "%s", Str ) )

     {

         last = -;

         memset( vis, , sizeof(vis) );

         index = ;

         ans = ;

         for( int i = ; Str[i] != '\0'; i ++ )///'A', 'E', 'I', 'O', 'U' and 'Y'.

         {

             index ++;

             if( Str[i] == 'A' || Str[i] == 'E' || Str[i] == 'I' || Str[i] == 'O' || Str[i] == 'U' || Str[i] == 'Y' )

             {

                 vis[index] = i + ;

                 last = i;

             }

         }

         int tmp = ;

         for( int i = ; i <= index; i ++ )

         {

             if(vis[i])

             {

                 //printf( "%d ", vis[i] );

                 ans = max( vis[i] - tmp, ans );

                 tmp = vis[i];

             }

         }

         int L = strlen(Str);

         ans = max( L - last, ans );

         if( index >=  )

             ans = max( vis[ index -  ] - vis[ index -  ], ans );

         //printf( "\nlast = %d,\tL = %d,\tindex = %d\n", last, L,index );

         printf( "%d\n", ans );

     }

     return ;

 }

版本10代码：

 #include <bits/stdc++.h>

 using namespace std;

 int main()

 {

     char Str[];

     int vis[];

     int index, ans, last, tot;

     while( ~scanf( "%s", Str ) )

     {

         last = -;

         memset( vis, , sizeof(vis) );

         tot = index = ;

         ans = ;

         for( int i = ; Str[i] != '\0'; i ++ )///'A', 'E', 'I', 'O', 'U' and 'Y'.

         {

             tot ++;

             if( Str[i] == 'A' || Str[i] == 'E' || Str[i] == 'I' || Str[i] == 'O' || Str[i] == 'U' || Str[i] == 'Y' )

             {

                 vis[ index ++ ] = i + ;

                 last = i;

             }

         }

         int tmp = ;

         for( int i = ; i <= tot; i ++ )

         {

             if(vis[i])

             {

                 //printf( "%d ", vis[i] );

                 ans = max( vis[i] - tmp, ans );

                 tmp = vis[i];

             }

         }

         int L = strlen(Str);

         ans = max( L - last, ans );

         if( index >=  )

             ans = max( vis[ index -  ] - vis[ index -  ], ans );

         //printf( "\nlast = %d,\tL = %d,\tindex = %d\n", last, L,index );

         printf( "%d\n", ans );

     }

     return ;

 }

其实为了解决这道水题，不止这10个版本的代码，还有中间经过测试后弃用的。归根结底，还是太菜了，能力太差，编程技术烂导致的。

图1 艰难的AC之路

一道在CF上WA了9次才AC的A题题目与10个版本的代码代码的更多相关文章

CF上的3道小题(2)
CF上的3道小题(2) T1:CF630K Indivisibility 题意:给出一个数n,求1到n的数中不能被2到9中任意一个数整除的数. 分析:容斥一下,没了. 代码: #include < ...
CF上的3道小题(1)
CF上的3道小题终于调完了啊.... T1:CF702E Analysis of Pathes in Functional Graph 题意:你获得了一个n个点有向图,每个点只有一条出边.第i个点的 ...
Taurus.MVC-Java 版本打包上传到Maven中央仓库（详细过程）：5、Maven版本发布与后续版本更新（大结局）
文章目录: Taurus.MVC-Java 版本打包上传到Maven中央仓库(详细过程):1.JIRA账号注册 Taurus.MVC-Java 版本打包上传到Maven中央仓库(详细过程):2.PGP ...
cf上分的失落->高兴->更失落
cf昨日做出一个题居然div2打了1800多名直接上分了...我原以为垂直落地但是....我现在1399差一分就能蓝名了啊啊啊啊,以后不一定会有这个水平的啊,给个蓝名体验卡不行吗,多加一分会死啊... ...
帮朋友解决一道 LeetCode QJ上问题
引言对于刷题,自己是没能力的. 最经一个朋友同事考我一道数组题 . 也许能当面试分享吧. 娱乐娱乐. 事情的开始是这样的. 前言题目截图大概意思是在一个数组中,找出其中两个不重复出现的元 ...
One day one cf,Keep Wa away from me.
Codeforces Round #379 (Div. 2) A水,算字符个数 B水,贪心优先组成后者 C贪心尺取,以消耗排序change那个,然后贪心另一个 D对角线就是x0+y0 == x1+y1 ...
一道在输入上有坑点的LCS
原题连接 http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=114&p ...
CF上部分树形DP练习题
本次 5 道题均来自Codeforce 关于树形DP的算法讲解:Here 791D. Bear and Tree Jumps 如果小熊每次能跳跃的距离为1,那么问题变为求树上任意两点之间距离之和. 对 ...
关于一道面试题【字符串 '1 + (5 - 2) * 3'，怎么算出结果为10，'eval'除外】
最近徘徊在找工作和继续留任的纠结之中,在朋友的怂恿下去参加了一次面试,最后一道题目是: 写一个函数,输入一个字符串的运算式,返回计算之后的结果.例如这样的: '1 + (5 - 2) * 3',计算出 ...

随机推荐

linux系统文件目录解析
/bin 二进制可执行命令 /dev 设备文件(硬盘/光驱等) /etc 系统管理和配置文件 /etc/rc.d 启动的配置文件和脚本 /home 用户主目录,下面会有以登录用户名作为文件夹名 ...
hibernate Day2
Day21 实体类编写规则(1 ) 实体类中的属性是私有属性(2) 私有属性要生成get与set方法(3) 实体类中有属性作为唯一值(一般使用id值)(4) 实体类属性建议不要使用基本数据类型, 应当 ...
popoverController使用注意--转
一.设置尺寸提示:不建议,像下面这样吧popover的宽度和高度写死. 1 //1.新建一个内容控制器 2 YYMenuViewController *menuVc=[[YYMenuViewCont ...
ORA-12162
2.故障原因诡异的故障背后的原因竟然是那样的基础:ORACLE_SID没有指定!确认系统当前的ORACLE_HOME和ORACLE_SID环境变量 [oracle@asdlabdb01 ~]$ ec ...
windows clone 迁移数据库
windows clone 迁移数据库可行.(c 盘底成复制)
132 Palindrome Partitioning II 分割回文串 II
给定一个字符串 s,将 s 分割成一些子串,使每个子串都是回文串.返回 s 符合要求的的最少分割次数.例如,给出 s = "aab",返回 1 因为进行一次分割可以将字符串 s 分 ...
MongoDB管理练习
一.索引 1.插入10W条数据文档内容为:{name:zs-i,age:1} 2016-06-07T14:35:57.041+0800 I CONTROL [initandlisten] > ...
angularjs之ng-mode获取lobject类型里的键值
有时候数据库定义的时候,用一个对象来代表某个属性,之后直接访问对象就可以获取全部该对象的属性,但是有时需求访问对象中包含中的键值,引用键值的时候可以直接用.来获取对象的键值,比如对象points: ...
android开发学习 ------- 【转】Genymotion 小白安装
参考 https://www.cnblogs.com/whycxb/p/6850454.html 很详细,全面
arttemplate模板引擎有假数据返回数据多层内嵌的渲染方法
<!DOCTYPE html> <html lang="en"> <head> <meta charset="UTF-8&quo ...

一道在CF上WA了9次才AC的A题题目与10个版本的代码代码

一道在CF上WA了9次才AC的A题题目与10个版本的代码代码的更多相关文章

随机推荐

热门专题