Pagini recente » Cod sursa (job #502263) | Cod sursa (job #2702637) | Cod sursa (job #198670) | Cod sursa (job #502261) | Cod sursa (job #2386787)
#include <fstream>
#include <algorithm>
using namespace std;
ifstream fin("litere.in");
ofstream fout("litere.out");
char v[10001],mxm;
int n,i,j,total,poz;
char c;
int main()
{
fin>>n;
fin.get();
fin.getline(v,10000);
for(i=n-1;i>=0;i--){
// fout<<"pe poz "<<i<<" vrem sa aducem maximul, momentan avem "<<v[i]<<" \n";
mxm=v[i];
for(j=i-1;j>=0;j--)
if(v[j]>mxm){
mxm=v[j];
poz=j;
}
if(mxm>v[i]){
total+=i-poz;
// fout<<"am gasit "<<v[poz]<<" pe poz "<<poz<<"\n";
// fout<<'\t'<<"adunam "<<i-poz<<"\n";
// fout<<total<<"\n\n";
swap(v[i],v[poz]);
}
// for(int k=0;k<n;k++)
// fout<<v[k];
// fout<<"\n\n";
}
fout<<total;
return 0;
}