fzuacm 2017 新生寒假训练 7

A - a

While Mahmoud and Ehab were practicing for IOI, they found a problem which name was Longest common subsequence. They solved it, and then Ehab challenged Mahmoud with another problem.

Given two strings a and b, find the length of their longest uncommon subsequence, which is the longest string that is a subsequence of one of them and not a subsequence of the other.

A subsequence of some string is a sequence of characters that appears in the same order in the string, The appearances don’t have to be consecutive, for example, strings “ac”, “bc”, “abc” and “a” are subsequences of string “abc” while strings “abbc” and “acb” are not. The empty string is a subsequence of any string. Any string is a subsequence of itself.

Input:

The first line contains string a, and the second line — string b. Both of these strings are non-empty and consist of lowercase letters of English alphabet. The length of each string is not bigger than 10$^5$ characters.

Output:

If there’s no uncommon subsequence, print “-1”. Otherwise print the length of the longest uncommon subsequence of a and b.

Example:

Input:

abcd
defgh

Output:

5

---

Input:

a
a

Output:

-1

---

Note:

In the first example: you can choose “defgh” from string b as it is the longest subsequence of string b that doesn’t appear as a subsequence of string a.

---

Code:

#include <stdio.h>
#include <string.h>
int main (void)
{
    char s1[100010],s2[100010];
    scanf("%s",s1);
    scanf("%s",s2);
    int n1=strlen(s1);
    int n2=strlen(s2);
    if (n1>n2)
        printf("%d\n",n1);
    else if (n1<n2)
        printf("%d\n",n2);
    else
    {
        if (strcmp(s1,s2)==0)
            printf("-1\n");
        else
            printf("%d\n",n1);
    }
    return 0;
}

// 如果两个字符串长度不等，则输出较长字符串的长度。

// 当两个字符串长度相等时，如果两个字符串为同一字符串，则输出 -1，否则输出字符串长度。

---

B - b

Mahmoud has n line segments, the i-th of them has length a$_i$. Ehab challenged him to use exactly 3 line segments to form a non-degenerate triangle. Mahmoud doesn’t accept challenges unless he is sure he can win, so he asked you to tell him if he should accept the challenge. Given the lengths of the line segments, check if he can choose exactly 3 of them to form a non-degenerate triangle.

Mahmoud should use exactly 3 line segments, he can’t concatenate two line segments or change any length. A non-degenerate triangle is a triangle with positive area.

Input:

The first line contains single integer n (3 ≤ n ≤ 105) — the number of line segments Mahmoud has.

The second line contains n integers a$_1$, a$_2$, …, a$_n$ (1 ≤ a$_i$ ≤ 109) — the lengths of line segments Mahmoud has.

Output:

In the only line print “YES” if he can choose exactly three line segments and form a non-degenerate triangle with them, and “NO” otherwise.

Example:

Input:

5
1 5 3 2 4

Output:

YES

---

Input:

3
4 1 2

Output:

-1

---

Note:

For the first example, he can use line segments with lengths 2, 4 and 5 to form a non-degenerate triangle.

---

Code:

#include <stdio.h>
#include <algorithm>            //调用sort函数需要的头文件
using namespace std;            //头文件<algorithm>为C++标准，所以要加这句
int main (void)
{
    int n;
    int a[100010];
    scanf("%d",&n);
    for (int i=0;i<n;i++)
        scanf("%d",&a[i]);

    sort(a,a+n);                //默认为从小到大排序
    for (int i=0;i<n-2;i++)
        if (a[i]+a[i+1]>a[i+2]) //判断三角形时，只要最大一边小于其余两边之和即可
        {
            printf("YES\n");
            return 0;
        }
    printf("NO\n");
    return 0;
}

// sort(begin,end,cmp);

// begin，end 为排序范围，cmp为比较函数，不写则默认为从小到大排序。若要从大到小排序，可写为

bool cmp(int a,int b)   //写在main函数之前
{
    return a>b;     //降序排列，如果改为return a<b; 则为升序
}

---