<!doctype html>
<html lang="en">
<head>
<meta charset="utf-8">
<title>Contents</title>
<meta name="viewport" content="width=device-width, initial-scale=1">
</head>
<body>

[#心得](https://www.facebook.com/hashtag/%E5%BF%83%E5%BE%97?__eep__=6&#x26;__cft__[0]=AZUQAvrOLnhUg8gAgxrjuViGI2J9FXeLkv6ax2Suofq6zNNcLXJvnFptk_JrXNjWkgVi71x9_1aDD1Iw97g19_FPP7WBrz6EQhIlwqbClU5sMrA7p6gkaowWvOtSTJNz8DmfhxM7dqTGlUAQO4HPVeF_KRP5H6uzLl4UagGKGee4x1dURsFKE7FE04IyVf41Hpg&#x26;__tn__=*NK-R) [#解題](https://www.facebook.com/hashtag/%E8%A7%A3%E9%A1%8C?__eep__=6&#x26;__cft__[0]=AZUQAvrOLnhUg8gAgxrjuViGI2J9FXeLkv6ax2Suofq6zNNcLXJvnFptk_JrXNjWkgVi71x9_1aDD1Iw97g19_FPP7WBrz6EQhIlwqbClU5sMrA7p6gkaowWvOtSTJNz8DmfhxM7dqTGlUAQO4HPVeF_KRP5H6uzLl4UagGKGee4x1dURsFKE7FE04IyVf41Hpg&#x26;__tn__=*NK-R) [#The_Skyline_Problem](https://www.facebook.com/hashtag/the_skyline_problem?__eep__=6&#x26;__cft__[0]=AZUQAvrOLnhUg8gAgxrjuViGI2J9FXeLkv6ax2Suofq6zNNcLXJvnFptk_JrXNjWkgVi71x9_1aDD1Iw97g19_FPP7WBrz6EQhIlwqbClU5sMrA7p6gkaowWvOtSTJNz8DmfhxM7dqTGlUAQO4HPVeF_KRP5H6uzLl4UagGKGee4x1dURsFKE7FE04IyVf41Hpg&#x26;__tn__=*NK-R) [#Uva105](https://www.facebook.com/hashtag/uva105?__eep__=6&#x26;__cft__[0]=AZUQAvrOLnhUg8gAgxrjuViGI2J9FXeLkv6ax2Suofq6zNNcLXJvnFptk_JrXNjWkgVi71x9_1aDD1Iw97g19_FPP7WBrz6EQhIlwqbClU5sMrA7p6gkaowWvOtSTJNz8DmfhxM7dqTGlUAQO4HPVeF_KRP5H6uzLl4UagGKGee4x1dURsFKE7FE04IyVf41Hpg&#x26;__tn__=*NK-R)
這題我原先是不想開一個超大陣列(10000個元素)，
原本是寫了個結構去存他每一段，找每一段的左界和右界，但我後來發現這個方法卡有點久，因此後來還是用直接用陣列存高度的方法。不過我覺得或許有更好執行更少次的方法，可以改天再寫寫看。
![](https://i.imgur.com/dxGxajN.jpg)
## Ref
- https://www.facebook.com/groups/363494050740833/permalink/416953388728232/

</body>
</html>


[#心得](https://www.facebook.com/hashtag/%E5%BF%83%E5%BE%97?__eep__=6&__cft__[0]=AZUQAvrOLnhUg8gAgxrjuViGI2J9FXeLkv6ax2Suofq6zNNcLXJvnFptk_JrXNjWkgVi71x9_1aDD1Iw97g19_FPP7WBrz6EQhIlwqbClU5sMrA7p6gkaowWvOtSTJNz8DmfhxM7dqTGlUAQO4HPVeF_KRP5H6uzLl4UagGKGee4x1dURsFKE7FE04IyVf41Hpg&__tn__=*NK-R) [#解題](https://www.facebook.com/hashtag/%E8%A7%A3%E9%A1%8C?__eep__=6&__cft__[0]=AZUQAvrOLnhUg8gAgxrjuViGI2J9FXeLkv6ax2Suofq6zNNcLXJvnFptk_JrXNjWkgVi71x9_1aDD1Iw97g19_FPP7WBrz6EQhIlwqbClU5sMrA7p6gkaowWvOtSTJNz8DmfhxM7dqTGlUAQO4HPVeF_KRP5H6uzLl4UagGKGee4x1dURsFKE7FE04IyVf41Hpg&__tn__=*NK-R) [#The_Skyline_Problem](https://www.facebook.com/hashtag/the_skyline_problem?__eep__=6&__cft__[0]=AZUQAvrOLnhUg8gAgxrjuViGI2J9FXeLkv6ax2Suofq6zNNcLXJvnFptk_JrXNjWkgVi71x9_1aDD1Iw97g19_FPP7WBrz6EQhIlwqbClU5sMrA7p6gkaowWvOtSTJNz8DmfhxM7dqTGlUAQO4HPVeF_KRP5H6uzLl4UagGKGee4x1dURsFKE7FE04IyVf41Hpg&__tn__=*NK-R) [#Uva105](https://www.facebook.com/hashtag/uva105?__eep__=6&__cft__[0]=AZUQAvrOLnhUg8gAgxrjuViGI2J9FXeLkv6ax2Suofq6zNNcLXJvnFptk_JrXNjWkgVi71x9_1aDD1Iw97g19_FPP7WBrz6EQhIlwqbClU5sMrA7p6gkaowWvOtSTJNz8DmfhxM7dqTGlUAQO4HPVeF_KRP5H6uzLl4UagGKGee4x1dURsFKE7FE04IyVf41Hpg&__tn__=*NK-R)

這題我原先是不想開一個超大陣列(10000個元素)，

原本是寫了個結構去存他每一段，找每一段的左界和右界，但我後來發現這個方法卡有點久，因此後來還是用直接用陣列存高度的方法。不過我覺得或許有更好執行更少次的方法，可以改天再寫寫看。
![](https://i.imgur.com/dxGxajN.jpg)
## Ref
- https://www.facebook.com/groups/363494050740833/permalink/416953388728232/


20180314-uva105

[#心得](https://www.facebook.com/hashtag/%E5%BF%83%E5%BE%97?__eep__=6&__cft__[0]=AZUQAvrOLnhUg8gAgxrjuViGI2J9FXeLkv6ax2Suofq6zNNcLXJvnFptk_JrXNjWkgVi71x9_1aDD1Iw97g19_FPP7WBrz6EQhIlwqbClU5sMrA7p6gkaowWvOtSTJNz8DmfhxM7dqTGlUAQO4HPVeF_KRP5H6uzLl4UagGKGee4x1dURsFKE7FE04IyVf41Hpg&__tn__=*NK-R) [#解題](https://www.facebook.com/hashtag/%E8%A7%A3%E9%A1%8C?__eep__=6&__cft__[0]=AZUQAvrOLnhUg8gAgxrjuViGI2J9FXeLkv6ax2Suofq6zNNcLXJvnFptk_JrXNjWkgVi71x9_1aDD1Iw97g19_FPP7WBrz6EQhIlwqbClU5sMrA7p6gkaowWvOtSTJNz8DmfhxM7dqTGlUAQO4HPVeF_KRP5H6uzLl4UagGKGee4x1dURsFKE7FE04IyVf41Hpg&__tn__=*NK-R) [#The_Skyline_Problem](https://www.facebook.com/hashtag/the_skyline_problem?__eep__=6&__cft__[0]=AZUQAvrOLnhUg8gAgxrjuViGI2J9FXeLkv6ax2Suofq6zNNcLXJvnFptk_JrXNjWkgVi71x9_1aDD1Iw97g19_FPP7WBrz6EQhIlwqbClU5sMrA7p6gkaowWvOtSTJNz8DmfhxM7dqTGlUAQO4HPVeF_KRP5H6uzLl4UagGKGee4x1dURsFKE7FE04IyVf41Hpg&__tn__=*NK-R) [#Uva105](https://www.facebook.com/hashtag/uva105?__eep__=6&__cft__[0]=AZUQAvrOLnhUg8gAgxrjuViGI2J9FXeLkv6ax2Suofq6zNNcLXJvnFptk_JrXNjWkgVi71x9_1aDD1Iw97g19_FPP7WBrz6EQhIlwqbClU5sMrA7p6gkaowWvOtSTJNz8DmfhxM7dqTGlUAQO4HPVeF_KRP5H6uzLl4UagGKGee4x1dURsFKE7FE04IyVf41Hpg&__tn__=*NK-R)

這題我原先是不想開一個超大陣列(10000個元素)，

原本是寫了個結構去存他每一段，找每一段的左界和右界，但我後來發現這個方法卡有點久，因此後來還是用直接用陣列存高度的方法。不過我覺得或許有更好執行更少次的方法，可以改天再寫寫看。

原本是寫了個結構去存他每一段，找每一段的左界和右界，但我後來發現這個方法卡有點久，因此後來還是用直接用陣列存高度的方法。不過我覺得或許有更好執行更少次的方法，可以改天再寫寫看。
![](https://i.imgur.com/dxGxajN.jpg)

https://www.facebook.com/groups/363494050740833/permalink/416953388728232/