D1. Toy Train (Simplified)

https://codeforces.com/contest/1130/problem/D1

D2. Toy Train

https://codeforces.com/contest/1130/problem/D2

题解：

/*
*@Author:   STZG
*@Language: C++
*/
#include <bits/stdc++.h>
#include<iostream>
#include<algorithm>
#include<cstdlib>
#include<cstring>
#include<cstdio>
#include<string>
#include<vector>
#include<bitset>
#include<queue>
#include<deque>
#include<stack>
#include<cmath>
#include<list>
#include<map>
#include<set>
//#define DEBUG
#define RI register int
using namespace std;
typedef long long ll;
//typedef __int128 lll;
const int N=40000+10;
const int MOD=1e9+7;
const double PI = acos(-1.0);
const double EXP = 1E-8;
const int INF = 0x3f3f3f3f;
int t,n,m,k,q;
int ans,cnt,flag,temp;
int d[N],a,b;
int minv[N];
char str;
int main()
{
#ifdef DEBUG
	freopen("input.in", "r", stdin);
	//freopen("output.out", "w", stdout);
#endif
    scanf("%d%d",&n,&m);
    memset(minv, 0x3f, sizeof(minv));
    while(m--){
        scanf("%d%d",&a,&b);
        d[a]++;
        minv[a] = min(minv[a], (b + n - a) % n);
    }
    for(int i=1;i<=n;i++){
            ans=0;
        d[n+i]=d[i];
        minv[n+i]=minv[i];
        for(int j=0;j<n;j++){
            int pos=i+j;
            if (d[pos]) {
				ans = max(ans, (d[pos] - 1)*n + minv[pos] + j);
			}
        }

        printf("%d ",ans);
    }

    //cout << "Hello world!" << endl;
    return 0;
}