csp小明种苹果（续）

题目链接

#include <bits/stdc++.h>

using namespace std;

int n,m,x,e;
long long sum;

int main()
{
    cin>>n;
    sum = 0;
    e = 0;
    map<int,int>cnt;
    set<int>st;
    for(int j=0;j<n;++j){

        cin>>m;
        int temp = 0;
        for (int i = 0; i < m; ++i) {
            cin>>x;
            if(i != 0 && x > 0){
                if(temp > x) {
                    cnt[j] = 1;
                    st.insert(j);
                }
                sum -= temp;
                sum += x;
                temp = x;
            } else{
                sum += x;   temp += x;
            }
        }
    }
    for (int i = 0; i < n; ++i) {
        int l = (i + n - 1) % n;
        int r = (i + n + 1) % n;
        if(cnt[l] == 1 && cnt[i] == 1 && cnt[r] == 1)
            e++;
    }
    cout<<sum<<" "<<st.size()<<" "<<e<<endl;
    return 0;
}