Antiarithmetic?

最新推荐文章于 2018-03-11 20:05:32 发布

ACBOY、

最新推荐文章于 2018-03-11 20:05:32 发布

阅读量1.1k

点赞数

分类专栏：其他

本文链接：https://blog.csdn.net/crescent__moon/article/details/8794882

版权

其他专栏收录该内容

102 篇文章 0 订阅

订阅专栏

点击打开链接

E -design-easy

Crawling in process... Crawling failed

Time Limit: 3000MS Memory Limit: 0KB 64bit IO Format: %lld & %llu

Submit Status

Description

Problem D: Antiarithmetic?

A permutation of n is a bijective function of the initial n natural numbers: 0, 1, ...n-1. A permutation p is called antiarithmetic if there is no subsequence of it forming an arithmetic progression of length bigger than 2, i.e. there are no three indices 0 ≤ i < j < k < n such that (p_i , p_j , p_k) forms an arithmetic progression.

For example, the sequence (2, 0, 1, 4, 3) is an antiarithmetic permutation of 5. The sequence (0, 5, 4, 3, 1, 2) is not an antiarithmetic permutation as its first, fifth and sixth term (0, 1, 2) form an arithmetic progression; and so do its second, forth and fifth term (5, 3, 1).

Your task is to check whether a given permutation of n is antiarithmetic.

There are several test cases, followed by a line containing 0. Each test case is a line of the input file containing a natural number 3 ≤ n ≤ 10000 followed by a colon and then followed byn distinct numbers separated by whitespace. All n numbers are natural numbers smaller thann.

For each test case output one line with yes or no stating whether the permutation is antiarithmetic or not.

Sample input

3: 0 2 1 
5: 2 0 1 3 4
6: 2 4 3 5 0 1
0

Output for sample input

yes
no
yes

Piotr Rudnicki

记下位置来求等差数列。

#include<stdio.h>
int z[10007];
int main()
{
    int m;
    while(scanf("%d: ",&m),m)
    {
        int n,t,flag=0;
        for(int a=0; a<m; a++)
        {
            scanf("%d",&t);
            z[t]=a;//记下位置
        }
        for(int b=0; b<m; b++)
        {
            for(int c=1; 2*c+b<m; c++)
            {
                if(z[b]<z[b+c]&&z[b+c]<z[b+2*c])//比较是否是等差数列
                {
                    printf("no\n");
                    flag=1;
                }
                if(flag==1)break;
            }
            if(flag==1)break;
        }
        if(!flag)printf("yes\n");

    }
    return 0;
}