1、小明种苹果
题目链接：https://sim.csp.thusaac.com/contest/17/problem/0
100分代码：
#include <iostream>
#include <algorithm>
#define N 1010
#define M 1010
using namespace std;
int a[N][M+1],b[N];
int main(int argc, char *argv[])
{int n,m;cin >> n >> m;int t = 0;int max_value = 0;for(int i = 0; i < n; i++){for(int j = 0; j < m+1; j++){cin >> a[i][j];t += a[i][j];}}cout << t << " ";for(int i = 0; i < n; i++){for(int j = 1; j < m+1; j++){b[i] += abs(a[i][j]); }max_value = max(max_value , b[i]);}int p = 0;for(int k = 0; k < n; k++){if(b[k] == max_value){p = b[k];cout << k+1 << " ";break; }}cout << p << endl;return 0;
}评测结果：
2、小明种苹果（续）
题目链接：https://sim.csp.thusaac.com/contest/17/problem/1
100分代码：
#include <iostream>
#include <algorithm>
using namespace std;
int main(int argc, char *argv[])
{int n;int m;int a[1010] = {0},b[1010] = {0};cin >> n;int ans = 0,t = 0,d = 0,v = 0, k = 0;for(int i = 0; i < n; i++){cin >> m;k = 0;for(int j = 0; j < m; j++){cin >> a[j];ans += a[j];if(a[j] > 0 && j > 0){if(ans - a[j] > a[j]){k++;if(k == 1){d++;b[v] = i+1;v++;}}ans = 0;ans += a[j];}}t += ans;ans = 0;}sort(b , b + d);int e = 0;if(n >= 3){for(int i = 1; i < d-1; i++){if(b[i+1] - b[i] == 1 && b[i] - b[i-1] == 1)e++;}if(b[d-1] - b[d-2] == 1 && b[d-1] == n && b[0] == 1)e++;if(b[0] == 1 && b[1] == 2 && b[d-1] == n)e++;}cout << t << " " << d << " " << e << endl;return 0;
}评测结果：
