poj 3913（水）

Description

You have devised a new encryption technique which encodes a message by inserting between its characters randomly generated strings in a clever way. Because of pending patent issues we will not discuss in detail how the strings are generated and inserted into the original message. To validate your method, however, it is necessary to write a program that checks if the message is really encoded in the final string.

Given two strings s and t, you have to decide whether s is a
subsequence of t, i.e. if you can remove characters from t such that the
concatenation of the remaining characters is s.

Input

The input contains several testcases. Each is specified by two
strings s, t of alphanumeric ASCII characters separated by
whitespace.The length of s and t will no more than 100000.

Output

For each test case output "Yes", if s is a subsequence of t,otherwise output "No".

Sample Input

sequence subsequence
person compression
VERDI vivaVittorioEmanueleReDiItalia
caseDoesMatter CaseDoesMatter

Sample Output

Yes
No
Yes
No
题意：递增或递减

 #include<iostream>
 #include<cstdio>
 #include<cmath>
 #include<algorithm>
 typedef long long ll;
 #include<cstring>
 #define N 200
 using namespace std;
 int main()
 {
     int t;
     scanf("%d",&t);
     int a[N],b[N],c[N];
     for(int i=;i<t;i++)
     {
         scanf("%d%d%d",&a[i],&b[i],&c[i]);
     }
     printf("Gnomes:\n");
     for(int j=;j<t;j++)
     {
         if((a[j]<b[j]&&b[j]<c[j])||(a[j]>b[j]&&b[j]>c[j]))
             printf("Ordered\n");
         else
             printf("Unordered\n");
     }
 }