HDU 4928 Series 2

有了题解以后这题就成了一个模拟题。不过写了好久才把它写对…… Sad

#include <iostream>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <algorithm>
#include <string>
#include <queue>
#include <stack>
#include <vector>
#include <map>
#include <set>
#include <functional>
#include <time.h>
 
using namespace std;
 
typedef __int64 ll;
 
const int INF = <<;
const int MAXN = (int) 1e5+;
 
ll a[MAXN];
int n;
 
inline int check(ll A[], int len) {
    bool INC = true, DEC = true;
    for (int i = ; i < len-; i++)
        if (A[i+]>A[i]) INC = false;
        else if (A[i+]<A[i]) DEC = false;
    return INC||DEC;
}
 
int solve() {
    int cur = ;
    int l = , r = n-;
    for (int i = ; i < n; i++) {
        while (l<r && a[l]==) l++;
        while (l<r && a[r]==) r--;
        l = max(, l-);
        r = min(r+, n-i);
 
        if (!check(a+l, r-l)) return i;
 
        for (int j = l; j < r; j++)
            a[j] = a[j+]-a[j];
        r--;
    }
    return n;
}
 
int main() {
    #ifdef Phantom01
        freopen("HDU4928.txt", "r", stdin);
    #endif //Phantom01
 
    int T;
    scanf("%d", &T);
    while (T--) {
        scanf("%d", &n);
        for (int i = ; i < n; i++)
            scanf("%I64d", &a[i]);
        int ans = solve();
        if (==ans) puts("ugly series");
        else if (n==ans) puts("nice series");
        else printf("%d\n", ans-);
    }
 
    return ;
}