IvanIsCoding

IvanIsCoding

IvanIsCoding

IvanIsCoding

IvanIsCoding

IvanIsCoding

IvanIsCoding

IvanIsCoding

// Ivan Carvalho
// Problem A - Educational Dynamic Programming Contest - AtCoder
// Link : https://atcoder.jp/contests/dp
#include <bits/stdc++.h>
using namespace std;

const int MAXN = 1e5 + 10;
const int INF = 2*1e9;

int dp[MAXN],N,K,h[MAXN];

IvanIsCoding

/*
Tidal Flow Algorithm by M. Fontaine : https://ioinformatics.org/journal/v12_2018_25_41.pdf
Implementation by I. Carvalho
Solution to FASTFLOW : https://www.spoj.com/problems/FASTFLOW/
Note : In this problem, node 1 is the source and node N is the Sink
*/
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;

IvanIsCoding

// Ivan Carvalho
// Amusement Park - JOI Open 2017
#include "Ioi.h"
#include <bits/stdc++.h>
using namespace std;
 
const int MAXN = 10011;
const int MAXL = 60;
 
static vector<int> grafo[MAXN],tree[MAXN],lista;