{"provider_name":"Hatena Blog","description":"#include <vector> #include <string> #include <iostream> #include <algorithm> using namespace std; class dna { public: string seq; int unsortedness; int getuns(){ unsortedness = 0; for(int i = 0, l = seq.size() - 1; i < l; i++){ for(int j = i + 1, m = l + 1; j < m; j++){ if(seq[i] > seq[j]) unsortedn\u2026","author_url":"https://blog.hatena.ne.jp/peryaudo/","provider_url":"https://hatena.blog","categories":["PKU","Algorithm","Programming"],"title":"PKU 1007 DNA Sorting","url":"https://peryaudo.hatenablog.com/entry/20100726/1280153806","blog_title":"\u30da\u30ea\u30e3\u30a6\u30c9\u306e\u65e5","height":"190","type":"rich","image_url":null,"author_name":"peryaudo","html":"<iframe src=\"https://hatenablog-parts.com/embed?url=https%3A%2F%2Fperyaudo.hatenablog.com%2Fentry%2F20100726%2F1280153806\" title=\"PKU 1007 DNA Sorting - \u30da\u30ea\u30e3\u30a6\u30c9\u306e\u65e5\" class=\"embed-card embed-blogcard\" scrolling=\"no\" frameborder=\"0\" style=\"display: block; width: 100%; height: 190px; max-width: 500px; margin: 10px 0px;\"></iframe>","version":"1.0","blog_url":"https://peryaudo.hatenablog.com/","published":"2010-07-26 23:16:46","width":"100%"}