Pagini recente » Cod sursa (job #1338418) | Cod sursa (job #1102543) | Cod sursa (job #1522849) | Cod sursa (job #3147069) | Cod sursa (job #1211856)
#include <iostream>
#include <fstream>
using namespace std;
int main()
{
ifstream f("secv2.in");
ofstream g("secv2.out");
int n,v[100000],p1,p2,bestSum,l,k,sum[100000],best[100000],mn,i,curs;
f>>n;
f>>l;
for(int i=1;i<=n;i++)
{
f>>v[i];
}
sum[0] = 0;
for (i = 1; i <= n; i++)
sum[i] = v[i] + sum[i-1];
mn = sum[0];
curs=1;
bestSum = -100000;
for (i = 1; i <= n; i++) {
best[i] = sum[i] - mn;
if (mn > sum[i]) {mn = sum[i];
curs=i+1;
}
if (bestSum < best[i]){
p2=i;
p1=curs;
bestSum = best[i];
}
}
g<<p1<<" "<<p2<<" "<<bestSum;
//for(int i=p1;i<=p2;i++)
// cout<<v[i]<<" ";
cout << "Hello world!" << endl;
return 0;
}