Add English tutorial for LOJ-1101 – A Secret Mission

[sadat2103108]

Closes#521.

Problem link: https://lightoj.com/problem/a-secret-mission

Changes introduced in this PR

• Added English tutorial for LOJ-1101 – A Secret Mission
• Explained solution using Minimum Spanning Tree + LCA with Binary Lifting
• Included full implementation with comments

[Copilot]

Pull request overview

This PR adds an English tutorial for LightOJ problem 1101 "A Secret Mission", which is a minimax path problem solved using Minimum Spanning Tree (MST) combined with Lowest Common Ancestor (LCA) queries via binary lifting.

Changes:

• Added comprehensive tutorial explaining the minimax path problem and why MST+LCA is the appropriate solution
• Provided complexity analysis showing O(M log N) for MST, O(N log N) for preprocessing, and O(log N) per query
• Included C++ implementation using Prim's algorithm for MST and binary lifting for LCA queries

---

💡 Add Copilot custom instructions for smarter, more guided reviews. Learn how to get started.

[Copilot]

Pull request overview

Copilot reviewed 1 out of 1 changed files in this pull request and generated 2 comments.

---

💡 Add Copilot custom instructions for smarter, more guided reviews. Learn how to get started.