[ 9.12 ]CF每日一题系列—— 960B暴力数组

#include <iostream>
#include <cstdio>
using namespace std;
const int maxn = 1e6 + 1e3;
int a[maxn],b[maxn];
int main()
{
    int n,m;
    while(~scanf("%d%d",&n,&m))
    {
        for(int i = 1;i <= n;++i)
            scanf("%d",&a[i]);
        for(int i = 1;i <= m;++i)
            scanf("%d",&b[i]);
        int cnt = 0;
        int x = 1,y = 1;
        while(x <= n && y <= m)
        {
            if(a[x] == b[y])
            {
                ++x;++y;++cnt;
            }
            else if(a[x] < b[y])
            {
                x++;
                a[x] += a[x-1];
            }
            else if(a[x] > b[y])
            {
                y++;
                b[y] += b[y-1];
            }
        }
        printf("%d\n",cnt);
    }
    return 0;
}