Update: Rename folder name to XSMOJ

XSMOJ/数字三角形问题.cpp

@@ -0,0 +1,30 @@
+#include <algorithm>
+#include <iostream>
+#include <iomanip>
+#include <cstring>
+#include <cstdio>
+#include <stack>
+#include <ctime>
+#include <cmath>
+#include <queue>
+typedef long long l;
+typedef double d;
+typedef char c;
+using namespace std;
+int n;
+int a[1000][1000];
+int main(){
+	cin >>n;
+	for(int i=1;i<=n;i++){
+		for(int j=1;j<=i;j++){
+			cin >>a[i][j];
+		}
+	}
+	for(int i=n;i>=1;i--){
+		for(int j=1;j<=i;j++){
+			a[i][j]+=max(a[i+1][j],a[i+1][j+1]);
+		}
+	}
+	cout <<a[1][1];
+	return 0;
+}