zoj 1188 DNA Sorting
2013-09-02 20:03
274 查看
简单题,直接暴力计算,注意PE错误就行了。
#include<iostream>
#include<algorithm>
using namespace std;
struct Node{
string dna;
int index;
int measure;
bool operator < (const Node &b) const
{
if(measure==b.measure) return index<b.index;
else return measure<b.measure;
}
}st[101];
int n,m;
int Cal(string a)
{
int i,j;
int num=0;
for(i=0; i<n; i++)
{
for(j=i+1; j<n; j++)
{
if(a[i]>a[j]) num++;
}
}
return num;
}
int main()
{
int N;
cin>>N;
for(int k=0; k<N; k++){
cin>>n>>m;
for(int i=0; i<m; i++)
{
st[i].index=i;
cin>>st[i].dna;
st[i].measure=Cal(st[i].dna);
}
sort(st,st+m);
for(int i=0; i<m; i++)
cout<<st[i].dna<<endl;
if(k<N-1) cout<<endl;
}
return 0;
}
#include<iostream>
#include<algorithm>
using namespace std;
struct Node{
string dna;
int index;
int measure;
bool operator < (const Node &b) const
{
if(measure==b.measure) return index<b.index;
else return measure<b.measure;
}
}st[101];
int n,m;
int Cal(string a)
{
int i,j;
int num=0;
for(i=0; i<n; i++)
{
for(j=i+1; j<n; j++)
{
if(a[i]>a[j]) num++;
}
}
return num;
}
int main()
{
int N;
cin>>N;
for(int k=0; k<N; k++){
cin>>n>>m;
for(int i=0; i<m; i++)
{
st[i].index=i;
cin>>st[i].dna;
st[i].measure=Cal(st[i].dna);
}
sort(st,st+m);
for(int i=0; i<m; i++)
cout<<st[i].dna<<endl;
if(k<N-1) cout<<endl;
}
return 0;
}
相关文章推荐
- ZOJ Problem Set–1188 DNA Sorting
- ZOJ 1188 DNA Sorting
- ZOJ Problem Set - 1188 DNA Sorting
- zoj 1188 - DNA Sorting
- zoj 1188 DNA Sorting
- zoj 1188 || poj 1007 DNA Sorting(水~)
- zoj_1188 DNA Sorting
- ZOJ 1188 DNA Sorting
- ZOJ 1188 DNA Sorting
- zoj 1188 DNA Sorting(STL)
- ZOJ Problem Set - 1188 DNA Sorting
- zoj 1188.DNA Sorting
- [水]ZOJ1188
- zoj_1188
- ZOJ 1188
- zju 1188 DNA Sorting
- ZOJ-1188
- zoj 1919(AC) && poj 2337(WA) (并差集 + 欧拉回路或欧拉通路)
- ZOJ 3422 2-SAT
- ZOJ 题目3612 Median(SBT输出中数)