第十四届蓝桥杯集训——练习解题阶段(无序阶段)-ALGO-939 区间最大和

#include<stdio.h>
int main()
{
    int N,i,result=0,max=0;
    scanf("%d",&N);
    int A[N];
    for(i=0;i<N;i++)
    {
        scanf("%d",&A[i]);
    }
    for(i=0;i<N;i++)
    {
        if(result+A[i]>=0){
            result+=A[i];
        }
        else {
            result=0;
        }
        if(result>=max){
            max = result;
        }
    }
    printf("%d",max);
    return 0;
}

#include<stdio.h>
#include<iostream>
#include<algorithm>
#include<string.h>
using namespace std;
typedef long long ll;
const int maxn=1e5+7;
ll a[maxn];
ll dp[maxn];
const ll INF=8e18;
ll n,num,x;
int main(){
    scanf("%d",&n);
    for(int i=1;i<=n;i++)scanf("%lld",&a[i]);//输入
    dp[0]=0;
    for(int i=1;i<=n;i++){//状态转移方程
        dp[i]=max(a[i],dp[i-1]+a[i]);
    }
    ll maxn=0;
    for(int i=1;i<=n;i++){//遍历找最大值
        maxn=max(dp[i],maxn);
    }
    printf("%lld\n",maxn);
}

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.io.PrintWriter;
import java.io.StreamTokenizer;


public class Main {
	static StreamTokenizer in = new StreamTokenizer(new BufferedReader(new InputStreamReader(System.in)));
	static PrintWriter out = new PrintWriter(new BufferedWriter(new OutputStreamWriter(System.out)));
	static int in() throws IOException {
		in.nextToken();
		return (int) in.nval;
	}
	
	static int N = 100010;
	static int n;
	static int[] nums = new int[N];
	public static void main(String[] args) throws IOException {
		n = in();
		for (int i = 1; i <= n; i++) {
			nums[i] = in();
		}
		int ans = nums[0];
		int[] dp = new int[n + 1];
		for(int i = 1; i <= n; i++) {
			dp[i] = Math.max(dp[i - 1] + nums[i], nums[i]);
			ans = Math.max(ans, dp[i]);
		}
		out.println(ans);
		out.flush();
	}
}

def run(nums):
    count=0
    sum=0
    for i in range(len(nums)):
        count+=nums[i]
        if count > sum:
            sum=count
        if count < 0:
            count=0
    return sum
n=int(input())
nums=list(map(int,input().split()))
a=run(nums)
print(a)