zoukankan      html  css  js  c++  java
  • hud 2577 How to Type

    How to Type

    Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
    Total Submission(s): 3435    Accepted Submission(s): 1595


    Problem Description
    Pirates have finished developing the typing software. He called Cathy to test his typing software. She is good at thinking. After testing for several days, she finds that if she types a string by some ways, she will type the key at least. But she has a bad habit that if the caps lock is on, she must turn off it, after she finishes typing. Now she wants to know the smallest times of typing the key to finish typing a string.
     
    Input
    The first line is an integer t (t<=100), which is the number of test case in the input file. For each test case, there is only one string which consists of lowercase letter and upper case letter. The length of the string is at most 100.
     
    Output
    For each test case, you must output the smallest times of typing the key to finish typing this string.
     
    Sample Input
    3 Pirates HDUacm HDUACM
     
    Sample Output
    8 8 8
     1 #include <iostream>
     2 #include <string.h>
     3 #include <stdlib.h>
     4 #include <stdio.h>
     5 #include <algorithm>
     6 #include <set>
     7 #include <map>
     8 using namespace std;
     9 void fun(char a[])
    10 {
    11     int b[200][2];
    12     memset(b,0,sizeof(b));
    13     b[0][1]=1;
    14     int i,j,len=strlen(a);
    15     for(i=1;i<=len;i++)
    16     {
    17         if(a[i-1]<='z'&&a[i-1]>='a')
    18         {
    19             b[i][0]=min(b[i-1][0]+1,b[i-1][1]+2);
    20             b[i][1]=min(b[i-1][0]+2,b[i-1][1]+2);
    21         }
    22         else
    23         {
    24             b[i][1]=min(b[i-1][0]+2,b[i-1][1]+1);
    25             b[i][0]=min(b[i-1][0]+2,b[i-1][1]+2);
    26         }
    27     }
    28     cout<<min(b[len][0],b[len][1]+1)<<endl;
    29 }
    30 int main()
    31 {
    32     int t;
    33     cin>>t;
    34     char a[200];
    35     while(t--)
    36     {
    37         cin>>a;
    38         fun(a);
    39     }
    40 }
    View Code
  • 相关阅读:
    WPF & DirectShow 相关资料
    Com开发之回调
    COM开发之结构体
    WPF 提供了以下关键帧动画类[msdn]
    COM数据类型与托管类型对照
    图文并茂 简单 ATL COM开发
    WPF 动画笔记
    ShaderEffect 相关资料
    Visual \UIElemnt\FrameworkElement\Control
    关于WPF装饰器的笔记
  • 原文地址:https://www.cnblogs.com/ERKE/p/3826873.html
Copyright © 2011-2022 走看看