一道在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',计算出 ...

随机推荐

pyinstaller模块
应用场景: 1 把一些python脚本推广到更多机器上运行,但无法保证他们都有安装python解释器,所以,打包可以免去这一障碍 win: 安装: 在cmd中运行pip install pyinsta ...
HDFS Java API
HDFS Java API 搭建Hadoop客户端与Java访问HDFS集群
题解报告：hdu 1520 Anniversary party（树形dp入门）
Problem Description There is going to be a party to celebrate the 80-th Anniversary of the Ural Stat ...
在 Windows 7 中禁用IPv6协议/IPv6隧道
How to disable certain Internet Protocol version 6 (IPv6) components in Windows Vista, Windows 7 and ...
Xml文档数据提取到Excel表中
近期,财务一位同事,吐槽:<某XX开票软件>导出数据文档只有Xml格式,竟然没有Excel文档,工作起来非常不方便,希望我想想办法.上图: 需求分析:Xml数据----> 提取到Da ...
VB.NET入门 ANDALSO 和OrElse 之于 AND，OR
Module Module1 Sub Main() Dim x As Integer = 8, y As Integer = 5, z As Integer = 3 Console.WriteLine ...
10.JAVA-接口、工厂模式、代理模式、详解
1.接口定义接口属于一个特殊的类,这个类里面只能有抽象方法和全局常量 (该概念在JDK1.8之后被打破,在1.8后接口中还可以定义普通方法和静态方法,在后续章节会详讲) 1.1 接口具有以下几个原 ...
EditText输入手机号自动带空格
xml: <EditText android:id="@+id/edit_main" android:layout_width="match_parent" ...
Javaweb学习笔记2—Tomcat和http协议
今天来讲javaweb的第二个阶段学习. 老规矩,首先先用一张思维导图来展现今天的博客内容. ps:我的思维是用的xMind画的,如果你对我的思维导图感兴趣并且想看到你们跟详细的备注信息,请点击下 ...
基于jmeter和shell的接口性能自动化
基于jmeter和shell的接口性能自动化 1. 总体需求由于性能测试中涉及的查询接口多,版本迭代频繁,版本更新后自动跑一轮查询业务的性能,可以及时发现一些开发修复bug触发的非预期的bug,利用 ...

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

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

随机推荐

热门专题