一个字符串游戏

https://ac.nowcoder.com/acm/contest/318/I

C++版本一

 

#include 
#include 
#include 
#include 
#include 
#define maxn 150010
struct Node {
    int sum, id;
} node[maxn];

int cmp(const void *a, const void *b) {
    struct Node *c=(Node *)a;
    struct Node *d=(Node *)b;
    if (c->sum == d->sum)
        return d->id - c->id;
    return c->sum - d->sum;
}
int max(int a,int b){
    return a>b?a:b;
}
int min(int a,int b){
    return a= 0; i--) {
            if (node[i].id > temp)
                ans = max(ans, node[i].id - temp);
            else
                temp = min(temp, node[i].id);
        }
        printf("%d\n", ans);
    }
    return 0;
}

 

C++版本二 

/*
*@Author:   STZG
*@Language: C++
*/
#include 
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include