https://github.com/slowikj/hard-problem
The solution to a codeforces' algorithmic task (dynamic programming)
https://github.com/slowikj/hard-problem
Last synced: 7 months ago
JSON representation
The solution to a codeforces' algorithmic task (dynamic programming)
- Host: GitHub
- URL: https://github.com/slowikj/hard-problem
- Owner: slowikj
- Created: 2016-09-11T16:24:33.000Z (about 9 years ago)
- Default Branch: master
- Last Pushed: 2016-09-24T16:56:54.000Z (about 9 years ago)
- Last Synced: 2025-01-20T14:50:19.727Z (9 months ago)
- Language: C++
- Homepage:
- Size: 16.6 KB
- Stars: 0
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# HardProblem
The solution to [a codeforces's algorithmic task](http://codeforces.com/problemset/problem/706/C) (dynamic programming)
Task
----
We are given a sequence of strings and for each string there is a cost
connected with reversing it.
The aim of the task is to compute the minimum cost of such reversing strings
that the obtained sequence of strings will be lexicographically sorted.
Example
----
Input
```
3
1 3 1
aa
ba
ac
```
Output:
```
1
```
because we can reverse only the third string and then
we get the following sorted sequence of strings:
```
aa
ba
ca
```