一本通股票买卖问题时间超限

题目时间超限50分(看题解也不对)
++i改了，scanf改了，火车头也加了，还有哪里错了？

代码：

#pragma GCC optimize(3)
#pragma GCC target("avx")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("inline")
#pragma GCC optimize("-fgcse")
#pragma GCC optimize("-fgcse-lm")
#pragma GCC optimize("-fipa-sra")
#pragma GCC optimize("-ftree-pre")
#pragma GCC optimize("-ftree-vrp")
#pragma GCC optimize("-fpeephole2")
#pragma GCC optimize("-ffast-math")
#pragma GCC optimize("-fsched-spec")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("-falign-jumps")
#pragma GCC optimize("-falign-loops")
#pragma GCC optimize("-falign-labels")
#pragma GCC optimize("-fdevirtualize")
#pragma GCC optimize("-fcaller-saves")
#pragma GCC optimize("-fcrossjumping")
#pragma GCC optimize("-fthread-jumps")
#pragma GCC optimize("-funroll-loops")
#pragma GCC optimize("-fwhole-program")
#pragma GCC optimize("-freorder-blocks")
#pragma GCC optimize("-fschedule-insns")
#pragma GCC optimize("inline-functions")
#pragma GCC optimize("-ftree-tail-merge")
#pragma GCC optimize("-fschedule-insns2")
#pragma GCC optimize("-fstrict-aliasing")
#pragma GCC optimize("-fstrict-overflow")
#pragma GCC optimize("-falign-functions")
#pragma GCC optimize("-fcse-skip-blocks")
#pragma GCC optimize("-fcse-follow-jumps")
#pragma GCC optimize("-fsched-interblock")
#pragma GCC optimize("-fpartial-inlining")
#pragma GCC optimize("no-stack-protector")
#pragma GCC optimize("-freorder-functions")
#pragma GCC optimize("-findirect-inlining")
#pragma GCC optimize("-fhoist-adjacent-loads")
#pragma GCC optimize("-frerun-cse-after-loop")
#pragma GCC optimize("inline-small-functions")
#pragma GCC optimize("-finline-small-functions")
#pragma GCC optimize("-ftree-switch-conversion")
#pragma GCC optimize("-foptimize-sibling-calls")
#pragma GCC optimize("-fexpensive-optimizations")
#pragma GCC optimize("-funsafe-loop-optimizations")
#pragma GCC optimize("inline-functions-called-once")
#pragma GCC optimize("-fdelete-null-pointer-checks")
#pragma GCC optimize(2)
#include 
using namespace std;
const int INF = 0x3f3f3f;
int a[100005], f1[100005], f2[100005];
int main() {
    int t, ans, x;
    scanf("%d", &t);
    while (t--) {
        int x;
        scanf("%d", &x);
        for (int i = 1; i <= x; ++i) scanf("%d", &a[i]);
        int minn = INF, maxx = -INF;
        f1[0] = 0;
        f2[x + 1] = 0;
        for (int i = 1; i <= x; ++i) {
            minn = min(minn, a[i]);
            f1[i] = max(f1[i - 1], a[i] - minn);
        }
        for (int i = x; i >= 1; --i) {
            maxx = max(maxx, a[i]);
            f2[i] = max(f2[x + 1], maxx - a[i]);
        }
        int ans = -INF;
        for (int i = 1; i <= x; ++i) ans = max(ans, f1[i] + f2[i]);
        printf("%d\n", ans);
    }
    return 0;
}

可参考

https://leetcode.cn/problems/best-time-to-buy-and-sell-stock-iii/solution/mai-mai-gu-piao-de-zui-jia-shi-ji-iii-by-wrnt/

题虽然是做过，但肯定是懒得找题号上POJ帮你测了。
1e5的数据，O(N)的复杂度，然后时间超限，如果你确定你的代码没问题，试试把前面那一大长串改成一个正常的头文件吧：
#include<bits/stdc++.h>
要是还是超时，那就应该是O(3N)过不去了，尝试一下把他改成贪心，这个题O(N)的复杂度是蛮好想的，一次循环就可以