제출 #1271351

#제출 시각아이디문제언어결과실행 시간메모리
1271351ahmd_ibraaaNizin (COCI16_nizin)C++20
30 / 100
1097 ms131072 KiB
#include <bits/stdc++.h> using namespace std; #define int long long #define double long double #define medal ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL); #define fi first #define sec second #define endl '\n' int n; int ans = 0; void rec(vector<int> now){ vector<int> rev = now; reverse(rev.begin(), rev.end()); if(rev==now){ ans = max(ans, (int)rev.size()); return; } for(int i=1; i<now.size(); i++){ vector<int> next = now; int val = next[i] + next[i-1]; next.erase(next.begin()+i-1, next.begin()+i+1); next.insert(next.begin()+i-1, val); rec(next); } } signed main(){ cin>>n; vector<int> a; for(int i=1; i<=n; i++){ int cek; cin>>cek; a.push_back(cek); } rec(a); cout<<n-ans; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...