• B. Fixed Points


    B. Fixed Points
    time limit per test
    2 seconds
    memory limit per test
    256 megabytes
    input
    standard input
    output
    standard output

    A permutation of length n is an integer sequence such that each integer from 0 to (n - 1) appears exactly once in it. For example, sequence [0, 2, 1] is a permutation of length 3 while both [0, 2, 2] and [1, 2, 3] are not.

    A fixed point of a function is a point that is mapped to itself by the function. A permutation can be regarded as a bijective function. We'll get a definition of a fixed point in a permutation. An integer i is a fixed point of permutation a0, a1, ..., an - 1 if and only if ai = i. For example, permutation [0, 2, 1] has 1 fixed point and permutation [0, 1, 2] has 3 fixed points.

    You are given permutation a. You are allowed to swap two elements of the permutation at most once. Your task is to maximize the number of fixed points in the resulting permutation. Note that you are allowed to make at most one swap operation.

    Input

    The first line contains a single integer n (1 ≤ n ≤ 105). The second line contains n integers a0, a1, ..., an - 1 — the given permutation.

    Output

    Print a single integer — the maximum possible number of fixed points in the permutation after at most one swap operation.

    Sample test(s)
    input
    5
    0 1 3 4 2
    output
    3

    思路:a[i] = k,且a[k] = i,即i==a[a[i]](k与i不相等)则可增加2,否则若sum!=n,则必增加1.

    #include<stdio.h>
    #include<math.h>
    int a[100001];
    int main()
    {
    int n,i,sum,flag,flag1,p;
    while(~scanf("%d",&n))
    {
    p = flag = flag1 = sum = 0;
    for(i = 0;i < n;i ++)
    {
    scanf("%d",&a[i]);
    if(i==a[i])
    sum++;
    }
    if(sum!=n)
    flag1 = 1;
    for(i = 0;i < n;i ++)
    {
    if(a[a[i]]==i&&a[i]!=i)
    {
    flag = 1;
    break ;
    }
    }
    if(!(flag+flag1))
    printf("%d ",sum);
    if(flag==1)
    {
    printf("%d ",sum+2);
    continue ;
    }
    if(flag==0&&flag1==1)
    printf("%d ",sum+1);
    }

  • 相关阅读:
    jQuery源码 support
    jQuery 源码: 延迟对象补充。
    web FG interview all
    Img load
    浅谈js中this指向问题
    浅谈ES6原生Promise
    BootStrap的两种模态框方式
    让div盒子相对父盒子垂直居中的几种方法
    normalize与reset
    JS实现继承的方式
  • 原文地址:https://www.cnblogs.com/anhuizhiye/p/3331470.html
Copyright © 2020-2023  润新知