Cod sursa(job #627463)
Utilizator | Data | 30 octombrie 2011 00:16:06 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <fstream>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int n,p,u,mx;
int main(){
int i,x;
f>>n;
f>>x;
int p1=1,u1=1,a=0,b=x;
p=1;u=1;mx=x;
for(i=2;i<=n/2;i++){
f>>x;
if(x>b+x){a=x; p1=i;u1=i;} else {u1=i; a=b+x; };
if(a>mx){p=p1;u=u1;mx=a;};
b=a;}
g<<mx<<' '<<p<<' '<<u<<'\n';
}