Cod sursa(job #800003)
Utilizator | Data | 20 octombrie 2012 15:35:50 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 25 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.51 kb |
#include<fstream>
using namespace std;
int main(){
fstream fin("ssm.in", ios::in), fout("ssm.out", ios::out);
int s, n,i,j,a,max=0,x,y,v[60000];
fin>>n;
for(i=1;i<=n;i++){
fin>>v[i];
}
for(i=1;i<=n;i++){
for(j=1;j<=n;j++){
if(i==j)s=v[i];
if(i!=j)s=s+v[j];
if(s>max){max=s; x=i; y=j;}
}
s=0;
}
for(i=1;i<=n;i++){
for(j=1;j<=n;j++){
if(i==j)s=v[i];
if(i!=j)s=s+v[j];
if(s==max){max=s; x=i; y=j; break;}
}
s=0;
}
fout<<max<<" "<<x<<" "<<y;
return 0;
}