1007 Maximum Subsequence Sum (25 分)「PTA甲级练习」

一个尝试一个存，注意特殊的情况，比如全为负数

#include 
#include 
#include 
#include 
#include 
#define dd double
#define PII pair
#define int long long
#define ll long long
using namespace std;
const dd eps = 1e-6;
const int mod = 998244353;
const int N = 1e5+10;

int arr[N];
struct node{
	int sum,front,back;
}temp,result;
signed main()
{
	int n;cin>>n;
	for(int i=0;i>arr[i];temp.sum += arr[i];
		if(i==0) result = temp;
		if(arr[i]>temp.sum)
		{
			temp.front = i;
			temp.sum = arr[i];
		}
		if(result.sum