NYOJ 109数列转换

守恒法--扩展阅读：http://www.cnblogs.com/dongsheng/archive/2013/03/04/2943206.html

#include<stdio.h>
#include<algorithm>
using namespace std;
int s1[1001],s2[1001];

int main()
{
//    freopen("in.txt","r",stdin);
    int n,m,i,a;
    scanf("%d",&n);
    while(n--)
    {
        scanf("%d",&m);
        for(i = 1; i <= m; ++i)
        {
            scanf("%d",&s1[i]);
            s1[i] += s1[i-1];
        }
        for(i = 1; i <= m; ++i)
        {
            scanf("%d",&s2[i]);
            s2[i] += s2[i-1];
        }

        sort(s1+1,s1+m+1);
        sort(s2+1,s2+m+1);

        if(equal(s1+1,s1+m,s2+1))
            printf("Yes\n");
        else
            printf("No\n");
    }
    return 0;
}