CodeForces 448B Suffix Structures
来源:互联网 发布:贪吃蛇跟随算法 编辑:程序博客网 时间:2024/06/06 20:43
题意:如果串A中包含串B的所有字母, 并且这些字母在串A和串B中排列顺序相同, 输出“automaton”, 否则,如果串A中包含串B的所有字母, 我们在这种情况下在进行讨论,如果A和B的长度相等, 输出“array”,如果A比B长,输出“both”, 否则输出“need tree”。
#include "stack"#include "cstdio"#include "iostream"#include "cmath"#include "set"#include "sstream"#include "cctype"#include "string"#include "cstring"#include "algorithm"#include "queue"#include "map"using namespace std;#define LL long long#define inf 0x7ffffff#define pa pair<int,int>#define pi 3.1415926535897932384626433832795028841971const int M=105;int main(){int i,j,k;char a[M],b[M];cin>>a>>b;int l1,l2;l1=strlen(a);l2=strlen(b);int flag=0;for(i=0,j=0;i<l2,j<l1;){if(b[i]==a[j]){i++;j++;if(i==l2 ){ printf("automaton\n");flag=1;}} else j++;} int c=0; if(flag==0) { for(i=0;i<l2;i++) { for(j=0;j<l1;j++) { if(b[i]==a[j]) { c++; a[j]=5; break; } } } if(c==l2 && l1==l2) printf("array\n"); else if(c==l2 && l1>l2) printf("both\n"); else printf("need tree\n"); }}
0 0
- Codeforces 448B. Suffix Structures
- Codeforces 448B Suffix Structures
- CodeForces 448-B. Suffix Structures
- CodeForces 448B Suffix Structures
- codeforces 448 B. Suffix Structures
- codeforces B. Suffix Structures
- codeforces Div.2 B.Suffix Structures
- Codeforces Div. 2 #256-B. Suffix Structures
- Codeforces Round #256 (Div. 2) B (448B) Suffix Structures
- Codeforces Suffix Structures
- B. Suffix Structures
- B. Suffix Structures
- Codeforces Round #256 (Div. 2) B. Suffix Structures
- Codeforces Round #256 (Div. 2) #B Suffix Structures
- Codeforces Round #256 (Div. 2) B. Suffix Structures
- Codeforces Round #256 (Div. 2) B. Suffix Structures(模拟)
- Codeforces Round #256 (Div. 2) B. Suffix Structures
- Codeforces Round #256 (Div. 2) B. Suffix Structures (乱搞)
- PCA 的具体实现 (Eigenfaces特征脸)
- 参数的作用域
- 浅谈Radius协议
- [Android实例] Android 4.0 平板全屏实现(一)
- Vb中VSFlexGrid控件的应用
- CodeForces 448B Suffix Structures
- poj 2394 Checking an Alibi
- C++新手提问 关于cin.getline()
- boost::algorithm 字符串处理
- 获取adb root权限
- hdu 1071 The area 高数积分求面积~~~~小水题~~
- PAT 1007. Maximum Subsequence Sum
- mysql 游标的使用
- 我的个人网站