CSP 小明种苹果（续）201909-2

#include <cstdio>
#include <algorithm>
#include <iostream>
#include <stack>
#include <cstring>
#define mem(a,b) memset(a,b,sizeof(a))

using namespace std;
typedef long long LL;
const int mod = 1e9+7;
int dir[4][2] = {0,1,0,-1,1,0,-1,0};
stack<int>q;
 int main()
{
    LL n;
    LL T = 0,D = 0,E = 0;
    cin >> n;
    int first = 0,second = 0;
    for(int i = 1; i <= n; i++) {
        int k;
        cin >> k;
        LL res1 = 0,kk;
        for(int j = 1; j <= k; j++) {
            cin >> kk;
            if(j == 1) {
                res1 = kk;
            } else {
                if(kk > 0) {
                    if(kk != res1)
                       {
                           if(q.size() == 0) {
                               q.push(i);
                               first = i;
                               D++;//在内部统计D 防止一个序号的苹果树被多次统计
                              // cout << i << endl;
                           } else if(q.size() == 1) {
                               int temp = q.top();
                               if(i != temp)
                               {
                                   q.push(i);
                                   second = i;
                                   D++;//如果该苹果树没有在栈中出现过Ｄ++
                                  // cout << i << endl;
                               }
                           }
                           else {
                               int temp = q.top();
                               if(i != temp)
                               {
                                   q.push(i);
                                   D++;
                                  // cout << i << endl;
                               }
                           }
                       }
                     res1 = kk;
                } else {
                    res1 -= -kk;
                }
            }
        }
        T += res1;
    }
    if(q.size() >= 3){//当发生苹果掉落的苹果树棵树大于等于３时才有可能出现连续的三个苹果树
    while(!q.empty()){
        int temp = q.top();
        q.pop();
        //苹果树序号连续的三种情况
        if((temp+1 == first && first+1 == second) || ((temp == n) && (first == 1) && (second == 2)) || ((temp == n-1) && (first == n) && (second = 1))) {
            E++;
        }
        second = first;
        first = temp;
    }
    }
    cout << T << " " << D << " " << E << endl;
    return 0;
}