// 求数组中连续三个数和得最大值
// 要求数组长度不小于3
#include <iostream >
using namespace std ;
// 整型的最小值
#define MY_INT_MIN int (( int (- 1) > 0 ? 0 : ( int ( 1) <<( ( sizeof ( int )<< 3) - 1) )))
int main ()
{
int num [] = { 1, 2, 4, - 1, 2, 11, - 1, - 2} ;
int n = sizeof (num ) / sizeof (*num );
int i ;
int max = MY_INT_MIN ;
int sum ;
for (i = 0; i <n - 3; i ++)
{
sum = num [i ]+num [i + 1] +num [i + 2] ;
if (max <sum )
{
max = sum ;
}
}
printf ( "%d/n" , max );
return 0;
}
// 要求数组长度不小于3
#include <iostream >
using namespace std ;
// 整型的最小值
#define MY_INT_MIN int (( int (- 1) > 0 ? 0 : ( int ( 1) <<( ( sizeof ( int )<< 3) - 1) )))
int main ()
{
int num [] = { 1, 2, 4, - 1, 2, 11, - 1, - 2} ;
int n = sizeof (num ) / sizeof (*num );
int i ;
int max = MY_INT_MIN ;
int sum ;
for (i = 0; i <n - 3; i ++)
{
sum = num [i ]+num [i + 1] +num [i + 2] ;
if (max <sum )
{
max = sum ;
}
}
printf ( "%d/n" , max );
return 0;
}