zoukankan      html  css  js  c++  java
  • CodeForces 523C

    C. Name Quest
    time limit per test
    2 seconds
    memory limit per test
    256 megabytes
    input
    standard input
    output
    standard output

    A Martian boy is named s — he has got this name quite recently from his parents for his coming of age birthday. Now he enjoys looking for his name everywhere. If he sees that he can obtain his name from some string by removing zero or more letters (at that, the remaining letters remain in the same order), he gets happy. For example, if saba», then strings «baobab», «aabbaa», «helloabahello» make him very happy and strings «aab», «baaa» and «helloabhello» do not.

    However rather than being happy once, he loves twice as much being happy twice! So, when he got string t as a present, he wanted to cut it in two parts (the left part and the right part) so that each part made him happy.

    Help s determine the number of distinct ways to cut the given string t into two parts in the required manner.

    Input

    The first line contains string s, consisting of lowercase English letters. The length of string s is from 1 to 1000 letters.

    The second line contains string t, that also consists of lowercase English letters. The length of string t is from 1 to 106 letters.

    Output

    Print the sought number of ways to cut string t in two so that each part made s happy.

    Sample test(s)
    input
    aba
    baobababbah
    output
    2
    input
    mars
    sunvenusearthmarsjupitersaturnuranusneptune
    output
    0
     1 #include<iostream>
     2 #include<cstdio>
     3 #include<algorithm>
     4 #include<cstring>
     5 #include<vector>
     6 #include<cstdlib>
     7 #include<math.h>
     8 using namespace std;
     9 char str[1007];
    10 char s1[1000007];
    11 int ans;
    12 int main()
    13 {
    14 
    15     while(~scanf("%s%s",str,s1)){
    16     int l1=strlen(str),l2=strlen(s1);
    17     int k=0,n1=-1,n2=-1;
    18     for(int i=0;i<l2;i++)
    19     {
    20         if(s1[i]==str[k]) k++;
    21         if(k==l1) {n1=i;break;}
    22     }
    23     k=0;
    24     for(int i=l2-1;i>=0;i--)
    25     {
    26         if(s1[i]==str[l1-1-k]) k++;
    27         if(k==l1) {n2=i;break;}
    28     }
    29     int ans;
    30     if(n2-n1<0) ans=0;
    31     else ans=n2-n1;
    32     printf("%d
    ",ans);
    33     memset(s1,0,sizeof(s1));
    34     memset(str,0,sizeof(str));
    35     }
    36     return 0;
    37 }
  • 相关阅读:
    13.线性回归
    12.scikit-learn中的Scaler
    11.数据归一化
    oracle之二表的几种类型
    oracle之二表和表空间的关系
    oracle之二数据字典表和动态性能视图
    oracle之二检查点
    oracle之二管理undo
    oracle之二归档日志
    oracle之二日志挖掘log miner
  • 原文地址:https://www.cnblogs.com/codeyuan/p/4358095.html
Copyright © 2011-2022 走看看