zoukankan      html  css  js  c++  java
  • codefroces Round #201.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.

    代码:

    #include<bits/stdc++.h>
    using namespace std;
    const int MAXN=1e5+3;
    int vis[MAXN];
    int main()
    {
        memset(vis,-1,sizeof(vis));
        int n,x;
        cin>>n;
        int res=0;
        for(int i=0;i<n;i++){
            cin>>x;
            if(x!=i) vis[i]=x;
            else res++;
        }
        //cout<<res<<endl;
        int flag=0;
        for(int i=0;i<n;i++){
            if(vis[i]!=-1){
                if(vis[vis[i]]!=-1){
                    flag=1;
                }
                if(vis[vis[i]]==i){
                    flag=2;
                    break;
                }
            }
        }
        //cout<<flag<<endl;
    //    for(int i=0;i<n;i++){
    //        cout<<vis[i]<<"	";
    //    }
        //cout<<endl;
        cout<<res+flag<<endl;
    }
  • 相关阅读:
    JavaScript的学习----2.操作BOM对象
    Maven的配置和Eclipse中导入SpringBoot项目一些注意点
    JavaScript学习----1.基础篇
    线程池的学习
    CSS的初步学习
    类的加载细节探索
    反射与注解
    数据结构第二章
    数据结构第一章
    用结构和STL常用算法实现对学生成绩的排序和查找(vector)
  • 原文地址:https://www.cnblogs.com/liuzhanshan/p/6556874.html
Copyright © 2011-2022 走看看