Uva1594 Ducci Sequence

大意： 有
1. (8, 11, 2, 7) → (3, 9, 5, 1) → (6, 4, 4, 2) → (2, 0, 2, 4) → (2, 2, 2, 2) → (0, 0, 0, 0).
2. (4, 2, 0, 2, 0) → (2, 2, 2, 2, 4) → (0,0,0,2,2) → (0, 0, 2, 0, 2) → (0, 2, 2, 2, 2) → (2, 0, 0, 0, 2) →
(2, 0, 0, 2, 0) → (2, 0, 2, 2, 2) → (2, 2, 0, 0, 0) → (0, 2, 0, 0, 2) → (2, 2, 0, 2, 2) → (0, 2, 2, 0, 0) →
(2, 0, 2, 0, 0) → (2, 2, 2, 0, 2) → (0, 0, 2, 2, 0) → (0, 2, 0, 2, 0) → (2, 2, 2, 2, 0) → (0,0,0,2,2) → · · ·
这两种情况，判断一组数是loop还是zero情况。
set判重

 用set<vecor<int> >来判重，简单题，但是由于我没清空set所以WA。细节注意。

#include <bits/stdc++.h>

using namespace std;
set<vector<int> > vis;
vector<int> temp,change;
int t,n;

void solve()
{
    vis.insert(temp);
    while(1)
    {
        int sum = 0;
        for(int i = 0; i < n-1; i++)
        {
            change.push_back( abs(temp[i] - temp[i+1]));
            sum += change[i];
        }
        change.push_back(abs(temp[n-1] - temp[0]));
        if(sum == 0)
        {   cout<<"ZERO\n";return;  }
        if(vis.count(change))
        {   cout<<"LOOP\n";return;  }
        else
            vis.insert(change);
        for(int i = 0; i < n ; i++)
            temp[i] = change[i];
        change.clear();
    }
}
int main()
{
    cin >> t;
    while(t--)
    {
        temp.clear();
        change.clear();
        vis.clear();
        int a;
        cin >> n;
        for(int i = 0; i < n ; i++)
        {
            cin >> a;
            temp.push_back(a);
        }
        solve();
    }
    return 0;
}