hihoCoder太阁最新面经算法竞赛12 register

Ended

Participants:164

Verdict:Accepted
Score:100 / 100
Submitted:2016-10-24 20:58:47

Lang:G++

Edit
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 100010;
int chary[MAXN];
int main()
{
    //freopen("in.txt", "r", stdin);
    int n, beg, endd;
    beg = endd = 0;
    int ans = 0;
    cin>>n;
    for( int i=0 ; i<n ; i++ )
        cin>>chary[i];
    int i,j;
    for( i=0 ; i<n-2 ; i++ )
    {
            if( chary[i] > chary[i+1] )
            {
                beg = i;
                break;
            }
    }
    for( i=n-2 ; i>=beg ; i-- )
    {
        if( chary[i] > chary[i+1] )
        {
            endd = i;
            break;
        }
    }
    sort( chary+beg, chary+endd+1 );
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX