Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include<fstream>
- #include <iostream>
- #include<algorithm>
- using namespace std;
- ifstream f("cerc.in");
- ofstream g("cerc.out");
- int st[20],n,v[20],maxi,sol[20];
- void citire()
- {
- f>>n;
- for(int i=1;i<=n;i++)
- f>>v[i];
- }
- int valid(int niv)
- {
- int i,ok=0;
- for(i=1; i<niv; i++)
- if(st[i]==st[niv])
- return 0;
- for(i=1;i<niv;i++)
- if(v[st[i]]==v[n])
- ok=1;
- if(ok==0)
- if(v[st[niv-1]]>v[st[niv]])
- return 0;
- if(ok==1)
- if(v[st[niv-1]]<v[st[niv]])
- return 0;
- return 1;
- }
- void sumamax()
- {
- int s=0,i;
- for(i=1;i<n;i++)
- s=s+v[st[i]]*v[st[i+1]];
- s=s+v[st[1]]*v[st[n]];
- if(s>maxi)
- {
- maxi=s;
- for(i=1;i<=n;i++)
- sol[i]=v[st[i]];
- }
- }
- void afisare_stiva()
- {
- int i;
- for(i=1; i<=n; i++)
- g<<sol[i]<<" ";
- g<<endl;
- }
- void back(int nivel)
- {
- if(nivel>n) sumamax();
- else
- {
- for(int i=1; i<=n; i++)
- {
- st[nivel]=i;
- if(valid(nivel))back(nivel+1);
- }
- }
- }
- int main ()
- {
- citire();
- sort(v+1,v+1+n);
- back(1);
- afisare_stiva();
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement