#include "fish.h"
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
const ll inf = 1e16;
long long max_weights(int n, int m, vector<int> x, vector<int> y, vector<int> w) {
vector<vector<ll>> p(n, vector<ll>(n, 0));
for(int i = 0; i < m; ++i) {
p[x[i]][y[i]] += w[i];
}
for(int i = 0; i < n; ++i) {
for(int j = 1; j < n; ++j) {
p[i][j] += p[i][j - 1];
}
}
vector<vector<vector<ll>>> dp(n + 1, vector<vector<ll>>(n + 1, vector<ll>(2, -inf)));
for(int i = 0; i <= n; ++i) {
dp[0][i][0] = dp[0][i][1] = 0;
}
//0 - increasing, 1 - decreasing
for(int i = 1; i < n; ++i) {
for(int lastlen = 0; lastlen <= n; ++lastlen) {
dp[i][0][0] = max({dp[i][0][0], dp[i - 1][lastlen][0], dp[i - 1][lastlen][1]});
dp[i][0][1] = max({dp[i][0][1], dp[i - 1][lastlen][0], dp[i - 1][lastlen][1]});
if(lastlen) {
dp[i][0][1] = max(dp[i][0][1], dp[i - 1][lastlen][1] + p[i][lastlen - 1]);
dp[i][0][1] = max(dp[i][0][1], dp[i - 1][lastlen][0] + p[i][lastlen - 1]);
}
for(int curlen = 1; curlen <= n; ++curlen) {
if(curlen >= lastlen) {
dp[i][curlen][0] = max(dp[i][curlen][0], dp[i - 1][lastlen][0] + p[i - 1][curlen - 1] - (lastlen ? p[i - 1][lastlen - 1] : 0));
}
if(curlen <= lastlen) {
dp[i][curlen][1] = max(dp[i][curlen][1], dp[i - 1][lastlen][1] + p[i][lastlen - 1] - p[i][curlen - 1]);
dp[i][curlen][1] = max(dp[i][curlen][1], dp[i - 1][lastlen][0] + p[i][lastlen - 1] - p[i][curlen - 1]);
}
}
}
}
ll ans = 0;
for(int i = 0; i <= n; ++i) {
ans = max({ans, dp[n - 1][i][0], dp[n - 1][i][1]});
}
return ans;
}
/*
5 4
0 2 5
1 1 2
4 4 1
3 3 3
*/
