summaryrefslogtreecommitdiff
path: root/I_anno/Programmazione_2/tastevin.cpp
diff options
context:
space:
mode:
authorSanto Cariotti <dcariotti24@gmail.com>2020-05-29 17:37:43 +0200
committerSanto Cariotti <dcariotti24@gmail.com>2020-05-29 17:37:43 +0200
commitc1b13da17b2d20bdb9392f0e390df771772f0020 (patch)
tree20f266a590a4bb36738355f54fd48f4229b58b05 /I_anno/Programmazione_2/tastevin.cpp
parentbc8b5b446a6a2d37bae82e7ad20e31e1439a2f0b (diff)
chore: order in coding contest folder
Diffstat (limited to 'I_anno/Programmazione_2/tastevin.cpp')
-rw-r--r--I_anno/Programmazione_2/tastevin.cpp38
1 files changed, 0 insertions, 38 deletions
diff --git a/I_anno/Programmazione_2/tastevin.cpp b/I_anno/Programmazione_2/tastevin.cpp
deleted file mode 100644
index 301ebcf..0000000
--- a/I_anno/Programmazione_2/tastevin.cpp
+++ /dev/null
@@ -1,38 +0,0 @@
-#include<iostream>
-#include<fstream>
-#include<vector>
-#include<algorithm>
-
-using namespace std;
-
-int main() {
- ifstream in("input.txt");
- ofstream out("output.txt");
-
- for(int ts = 0; ts < 100; ++ts) {
- int N;
- in >> N;
- vector<int> arr(N);
- for(int i = 0; i < N; ++i) {
- in >> arr.at(i);
- }
-
- vector<int> paths(N, 1);
-
- for(int i = N-2; i >= 0; --i) {
- int mx = 0;
- for(int j = i+2; j < N; ++j) {
- if(mx < paths[j] && arr[j] >= arr[i]) {
- mx = paths[j];
- }
- }
- paths[i] += mx;
- }
-
- out << *max_element(begin(paths), end(paths)) << '\n';
- }
-
- in.close();
- out.close();
- return 0;
-}