Pagini recente » Borderou de evaluare (job #1774911) | Cod sursa (job #327816) | Cod sursa (job #2311308) | Cod sursa (job #3002986) | Cod sursa (job #998452)
Cod sursa(job #998452)
#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <fstream>
#include <iterator>
using namespace std;
const string file = "ssm";
const string infile = file + ".in";
const string outfile = file + ".out";
const int INF = 0x3f3f3f3f;
int N;
vector<int> A;
vector<int> prec;
vector<int> DP;
int main()
{
fstream fin(infile.c_str(), ios::in);
fin >> N;
A.resize(N);
prec.resize(N);
DP.resize(N);
for(int i = 0; i < N; i++)
{
fin >> A[i];
}
fin.close();
DP[0] = A[0];
int maxS = 0;
int maxi = 0;
for(int i = 1; i < N; i++)
{
if(A[i] + DP[i-1] > A[i])
{
DP[i] = A[i] + DP[i-1];
}
else
{
DP[i] = A[i];
maxS = i;
}
if(DP[maxi] < DP[i])
maxi = i;
}
fstream fout(outfile.c_str(), ios::out);
fout << DP[maxi] << " " << maxS + 1 << " " << maxi + 1 <<"\n";
fout.close();
}