#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #pragma warning(disable:4996) #define fi first #define se second using namespace std; /* rope c++ #include using namespace __gnu_cxx; */ /* pbds c++ set전용 #include #include using namespace __gnu_pbds; #define ordered_set tree, rb_tree_tag,tree_order_statistics_node_update> multiset을 쓰고 싶으면 위의 코드에서 마지막 줄만 아래 코드로 변경.(대신 erase가 정상작동 되지 않는다.) #define ordered_set tree, rb_tree_tag,tree_order_statistics_node_update> 이외에 범위를 늘리고 싶으면 타입변경하면 된다. ex. int->ll, less_equal */ constexpr double PI = 3.1415926535; constexpr long long INF = 2147483647; constexpr long long lINF = 9000000000000000000; constexpr long long nlINF = lINF / 10000; constexpr int nINF = 1007483647; constexpr unsigned long long MOD1 = 1000000363; constexpr unsigned long long MOD2 = 1000000007; typedef long long ll; typedef unsigned long long ull; typedef pairsh_sh; typedef pair intint; typedef pair int_d; typedef pair dd; typedef pair int2_d; typedef pair intlong; typedef pair ll_ll; typedef pair int2_int; typedef pair int_int2; typedef pair ll_ll2; typedef pairll2_ll; typedef pair int2_int2; typedef pair ll2_ll2; typedef pair char_int; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); ll n, w, not_connect = 0, ans = 0; cin >> n; dequearr; for (int i = 0; i < n; i++) { cin >> w; arr.push_back(w); } for (int i = 0; i < n; i++) { if (arr.front() != 0)break; arr.push_back(arr.front()); arr.pop_front(); } bool first_meet = true; for (int i = 0; i < n; i++) { w = arr[i]; if (w == 0) { not_connect++; continue; } first_meet = false; ans += (not_connect + 1) / 2 + w; not_connect = 0; } if (first_meet) ans += not_connect / 2; else ans += (not_connect + 1) / 2; cout << ans; }

코드 #2532