bzoj4893项链分赃 神奇脑洞

这题是个神奇脑洞题。出题人看B站视频都能出题%%%%
http://www.bilibili.com/video/av9885078/
大概就是n种宝石最多切n刀，证明恶心不写了。
猜结论来一发结果过了= =

#include<cstdio>
#include<cstring>
#include<algorithm>
#include<iostream>
#include<cmath>
#define fo(i,a,b) for(int i=a;i<=b;i++)
#define fd(i,a,b) for(int i=a;i>=b;i--)
using namespace std;
int n, m;
const int N = 1e5 + 5;
int read()
{
    int x = 0, f = 1; char ch = getchar();
    while (ch<'0' || ch>'9') { if (ch == '-')f = -1; ch = getchar(); }
    while (ch >= '0'&&ch <= '9') { x = x * 10 + ch - '0'; ch = getchar(); }
    return x*f;
}
int a[N], b[N];
int s1[N], s2[N], s3[N];
int t1, t2, t3, sum1, sum2, sum3;
int main()
{
    n = read();
    fo(i, 1, n)
    {
        a[i] = read();
        if (a[i] == 0)sum1++;
        if (a[i] == 1)sum2++;
        if (a[i] == 2)sum3++;
    }
    fo(i, 1, n)
    {
        if (a[i] == 0)t1++;
        if (a[i] == 1)t2++;
        if (a[i] == 2)t3++;
        if (t1 == sum1 / 2 && t2 == sum2 / 2 && t3 == sum3 / 2)
        {
            printf("%d ", i);
            printf("1\n");
            return 0;
        }
    }
    fo(i, 1, n)
    {
        s1[i] = s1[i - 1];
        s2[i] = s2[i - 1];
        s3[i] = s3[i - 1];
        if (a[i] == 0)s1[i] = s1[i - 1] + 1;
        if (a[i] == 1)s2[i] = s2[i - 1] + 1;
        if (a[i] == 2)s3[i] = s3[i - 1] + 1;

    }
    int i = 1, j = n / 2;
    while (j <= n)
    {
        int ss1 = s1[j] - s1[i - 1];
        int ss2 = s2[j] - s2[i - 1];
        int ss3 = s3[j] - s3[i - 1];
        if (ss1 == sum1/2 && ss2 == sum2 / 2 && ss3 == sum3 / 2)
        {
            printf("2\n");
            return 0;
        }
        i++, j++;
    }
    printf("3\n");
    return 0;
}