PAT -1007

1007. Maximum Subsequence Sum 

Given a sequence of K integers { N1, N2, ..., NK }. A continuous subsequence is defined to be { Ni, Ni+1, ..., Nj } where 1 <= i <= j <= K. The Maximum Subsequence is the continuous subsequence which has the largest sum of its elements. For example, given sequence { -2, 11, -4, 13, -5, -2 }, its maximum subsequence is { 11, -4, 13 } with the largest sum being 20.

Now you are supposed to find the largest sum, together with the first and the last numbers of the maximum subsequence.

Input Specification:

Each input file contains one test case. Each case occupies two lines. The first line contains a positive integer K (<= 10000). The second line contains K numbers, separated by a space.

Output Specification:

For each test case, output in one line the largest sum, together with the first and the last numbers of the maximum subsequence. The numbers must be separated by one space, but there must be no extra space at the end of a line. In case that the maximum subsequence is not unique, output the one with the smallest indices i and j (as shown by the sample case). If all the K numbers are negative, then its maximum sum is defined to be 0, and you are supposed to output the first and the last numbers of the whole sequence.

Sample Input:
10
-10 1 2 3 4 -5 -23 3 7 -21
Sample Output:
10 1 4


#if 1

#include <stdio.h>

#define MAXN  (100000+1)

int FindMaxSubsequence(int a[],int n,int *l,int *r)
{
	int CurSum,MaxSum;
	int i,tempL;

	*l = 0;
	*r = 0;
	tempL = 0;
	CurSum = a[0];
	MaxSum = a[0];
	for(i = 1;i < n;i++)
	{
		if(CurSum < 0)
		{
			tempL = i;
			CurSum = 0;
		}

		CurSum += a[i];

		if(MaxSum < CurSum)
		{
			MaxSum = CurSum;
			*r = i;
			*l = tempL;
		}
	}
	return MaxSum;
}


int a[MAXN];
int main(int argc,char *argv[])
{
	int n;
	int i;
	int NegCnt;
	int l,r,MaxSum;
	
	freopen( "D:\\Chengsq\\in.txt" , "r" ,stdin);
    freopen( "D:\\Chengsq\\out.txt", "w" ,stdout);
	
	while(scanf("%d",&n) != EOF)
	{
		NegCnt = 0;
		for(i = 0;i < n;i++)
		{
			scanf("%d",&a[i]);
			if(a[i] < 0)
				NegCnt++;
		}

		if(NegCnt == n)
		{
			MaxSum = 0;
			l= 0;
			r = n-1;
		}
		else
			{
				MaxSum = FindMaxSubsequence(a,n,&l,&r);
			}

	 printf("%d %d %d\n",MaxSum,a[l],a[r]);
	}
	
	return 0;
}


#endif





内容概要:本文档为《400_IB Specification Vol 2-Release-2.0-Final-2025-07-31.pdf》,主要描述了InfiniBand架构2.0版本的物理层规范。文档详细规定了链路初始化、配置与训练流程,包括但不限于传输序列(TS1、TS2、TS3)、链路去偏斜、波特率、前向纠错(FEC)支持、链路速度协商及扩展速度选项等。此外,还介绍了链路状态机的不同状态(如禁用、轮询、配置等),以及各状态下应遵循的规则和命令。针对不同数据速率(从SDR到XDR)的链路格式化规则也有详细说明,确保数据包格式和控制符号在多条物理通道上的一致性和正确性。文档还涵盖了链路性能监控和错误检测机制。 适用人群:适用于从事网络硬件设计、开发及维护的技术人员,尤其是那些需要深入了解InfiniBand物理层细节的专业人士。 使用场景及目标:① 设计和实现支持多种数据速率和编码方式的InfiniBand设备;② 开发链路初始化和训练算法,确保链路两端设备能够正确配置并优化通信质量;③ 实现链路性能监控和错误检测,提高系统的可靠性和稳定性。 其他说明:本文档属于InfiniBand贸易协会所有,为专有信息,仅供内部参考和技术交流使用。文档内容详尽,对于理解和实施InfiniBand接口具有重要指导意义。读者应结合相关背景资料进行学习,以确保正确理解和应用规范中的各项技术要求。
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值