zoukankan      html  css  js  c++  java
  • Codeforce1343C. Alternating Subsequence

    Recall that the sequence b is a a subsequence of the sequence a if b can be derived from a by removing zero or more elements without changing the order of the remaining elements. For example, if a=[1,2,1,3,1,2,1], then possible subsequences are: [1,1,1,1], [3] and [1,2,1,3,1,2,1], but not [3,2,3] and [1,1,1,1,2].
    You are given a sequence a consisting of n positive and negative elements (there is no zeros in the sequence).
    Your task is to choose maximum by size (length) alternating subsequence of the given sequence (i.e. the sign of each next element is the opposite from the sign of the current element, like positive-negative-positive and so on or negative-positive-negative and so on). Among all such subsequences, you have to choose one which has the maximum sum of elements.
    In other words, if the maximum length of alternating subsequence is k then your task is to find the maximum sum of elements of some alternating subsequence of length k.
    You have to answer t independent test cases.

    Input

    The first line of the input contains one integer t (1≤t≤104) — the number of test cases. Then t test cases follow.
    The first line of the test case contains one integer n (1≤n≤2⋅105) — the number of elements in a. The second line of the test case contains n integers a1,a2,…,an (−109≤ai≤109,ai≠0), where ai is the i-th element of a.
    It is guaranteed that the sum of n over all test cases does not exceed 2⋅105 (∑n≤2⋅105).

    Output

    For each test case, print the answer — the maximum sum of the maximum by size (length) alternating subsequence of a.

    Example

    input
    4
    5
    1 2 3 -1 -2
    4
    -1 -2 -1 -3
    10
    -2 8 3 8 -4 -15 5 -2 -3 1
    6
    1 -1000000000 1 -1000000000 1 -1000000000
    output
    2
    -1
    6
    -2999999997

    Note

    In the first test case of the example, one of the possible answers is [1,2,3–,−1–––,−2].
    In the second test case of the example, one of the possible answers is [−1,−2,−1–––,−3].
    In the third test case of the example, one of the possible answers is [−2–––,8,3,8–,−4–––,−15,5–,−2–––,−3,1–].
    In the fourth test case of the example, one of the possible answers is [1–,−1000000000,1,-1000000000,1,−1000000000].

    题目大意:
    找到最长的+ - + - + - + - + -(+ -交替即可)的序列,求最长序列的最大值。

    这道题好像没什么好说的,就是找出每一段全正或全负的子序列最大值作为最长序列的数即可,可以用双指针算法。

    #include<bits/stdc++.h>
    using namespace std;
    typedef long long ll;
    const int N = 2e5 + 10;
    ll n, a[N];
    int main() {
    	//freopen("in.txt", "r", stdin);
    	int t; cin >> t;
    	while (t--) {
    		cin >> n;
    		ll ans = 0, now = 0;
    		for (int i = 1; i <= n; ++i) {
    			cin >> a[i];
    			if (i == 1)
    				now = a[i];
    			else {
    				if (a[i] * a[i - 1] > 0)
    					now = max(now, a[i]);
    				else
    					ans += now, now = a[i];
    			}
    		}
    		ans += now;//别忘记加上最后一位
    		cout << ans << endl;
    	}
    }
    
  • 相关阅读:
    使用yarn来替代npm
    React及Nextjs相关知识点小结
    appstore-react v2.0—redux-actions和redux-saga的应用
    开机SystemServer到ActivityManagerService启动过程分析
    java 读取气象专业格式NetCDF文件
    maven项目对于maven远程仓库没有资源的解决办法
    leaflet 使用kriging.js实现前端自定义插值
    leaflet 使用高德地图实例
    uni-app上使用leaflet地图的解决方案
    MySQL创建新用户并且赋予权限
  • 原文地址:https://www.cnblogs.com/RioTian/p/13501021.html
Copyright © 2011-2022 走看看