第十四届蓝桥杯集训——练习解题阶段(无序阶段)-ALGO-124 数字三角形

#include<stdio.h>
int n,a[100][100];
int sum();
int main(){
int i,num,j;
scanf("%d",&n);
for(i=0;i<n;i++)
{
    for(j=0;j<=i;j++)
    {
        scanf("%d",&num);
        a[i][j]=num;
    }
}


printf("%d",sum());



return 0;
}
/*
int sum(int i,int j)
{
    if(i==n)
    {
        return a[i][j];
    }

    if(sum(i+1,j)>sum(i+1,j+1))
    {
        return sum(i+1,j)+a[i][j];
    }else
    {
      return sum(i+1,j+1)+a[i][j];
    }
}
*/
int sum()
{
    int i,j;
    for(i=n-1;i>0;i--)
    {
        for(j=0;j<i;j++)
        {
            if(a[i][j]>a[i][j+1])
            {
                a[i-1][j]+=a[i][j];
            }
            else
            {
                a[i-1][j]+=a[i][j+1];
            }
        }
    }
    return a[0][0];
}

#include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
int main(){
	int n;
	cin >> n;
	vector<vector<int> >a(n + 1, vector<int>(n + 1));
	for (int i = 1; i <= n; i++){
		for (int j = 1; j <= i; j++){
			cin >> a[i][j];
		}
	}
	for (int i = 1; i <= n; i++){
		for (int j = 1; j <= i; j++){
			a[i][j] = max(a[i - 1][j - 1], a[i - 1][j]) + a[i][j];
		}
	}
	int max = a[n][1];
	for (int i = 2; i <= n; i++){
		if (a[n][i] > max) max = a[n][i];
	}
	cout << max << endl;

	system("pause");
	return 0;
}

import java.io.*;

public class Main {
	static StreamTokenizer in = new StreamTokenizer(new BufferedReader(new InputStreamReader(System.in))) ;
	static int n ;
	static int [][] a ;
	public static void main(String[] args) {
		n = getInt();
		a = new int[n][n] ;
		for( int i = 0 ; i < n ; i++ ) {
			for( int j = 0 ; j <= i ; j++ )
				a[i][j] = getInt() ;
		}
		for( int i = n-1 ; i > 0 ; i-- ) {
			for( int j = 0 ; j < i ; j++ ) {
				if( a[i][j] > a[i][j+1] )
					a[i-1][j] += a[i][j] ;
				else
					a[i-1][j] += a[i][j+1] ;
			}
		}
		
		System.out.println( a[0][0] );
	}

	private static int getInt() {
		try {
			in.nextToken() ;
		} catch (IOException e) {
			e.printStackTrace();
		}
		return (int) in.nval;
	}

}

n = int(input())
arr = []
for i in range(n):
    lis = list(map(int,input().split()))
    arr.append(lis)

#print(arr)

res = arr[:]
#print(res)
for i in range(n-2,-1,-1):
    for j in range(len(res[i])):
        res[i][j] = max(res[i+1][j],res[i+1][j+1])+res[i][j]

print(res[0][0])