codeforces #625 div.2 B. Journey Planning

第一次写博客。。。有不足望指正

B. Journey Planning

Tanya wants to go on a journey across the cities of Berland. There are n cities situated along the main railroad line of Berland, and these cities are numbered from 1 to n.

Tanya plans her journey as follows. First of all, she will choose some city c1 to start her journey. She will visit it, and after that go to some other city c2>c1, then to some other city c3>c2, and so on, until she chooses to end her journey in some city ck>ck−1. So, the sequence of visited cities [c1,c2,…,ck] should be strictly increasing.

There are some additional constraints on the sequence of cities Tanya visits. Each city i has a beauty value bi associated with it. If there is only one city in Tanya’s journey, these beauty values imply no additional constraints. But if there are multiple cities in the sequence, then for any pair of adjacent cities ci and ci+1, the condition ci+1−ci=bci+1−bci must hold.

For example, if n=8 and b=[3,4,4,6,6,7,8,9], there are several three possible ways to plan a journey:

c=[1,2,4];
c=[3,5,6,8];
c=[7] (a journey consisting of one city is also valid).
There are some additional ways to plan a journey that are not listed above.

Tanya wants her journey to be as beautiful as possible. The beauty value of the whole journey is the sum of beauty values over all visited cities. Can you help her to choose the optimal plan, that is, to maximize the beauty value of the journey?

Input
The first line contains one integer n (1≤n≤2⋅105) — the number of cities in Berland.

The second line contains n integers b1, b2, …, bn (1≤bi≤4⋅105), where bi is the beauty value of the i-th city.

Output
Print one integer — the maximum beauty of a journey Tanya can choose.

思路：此题是选择下标间隔等于数值差的一组数，取数和最大，顾名思义为 a[i]-a[j]=i-j;也就是说 a[i]-i=a[j]-j;因此我们取所有a[i]-i相同的加在一起，输出最大值即可，再次可以使用map容器便于计数。

#include <bits/stdc++.h>
using namespace std;
int main()
{
    map<int,long long>mp;
    int n;
    cin>>n;
    long long maxx=0;
    for(int i=1;i<=n;i++)
    {
        int x;
        cin>>x;
        mp[x-i]+=x;
        maxx=max(mp[x-i],maxx);
    }
    cout<<maxx;
}

还是很好理解的，类似于数学公式的题目一定是要推导公式的。