标签：limit round ret order least inter graph XML OWIN
首先是整数类型
设 ll a,k;
求a/k 向上取整
ans=(a-1)/k+1;
求a/k 向下取整
ans=(a-1)/k;
int/int 是整除
强制类型转化 等 都是向下取整
例题 codeforce C - Tokitsukaze and Discard Items
Codeforces Round #572 (Div. 2)
https://codeforces.com/contest/1191/problem/C
Recently, Tokitsukaze found an interesting game. Tokitsukaze had nn items at the beginning of this game. However, she thought there were too many items, so now she wants to discard mm (1≤m≤n1≤m≤n ) special items of them.
These nn items are marked with indices from 11 to nn . In the beginning, the item with index ii is placed on the ii -th position. Items are divided into several pages orderly, such that each page contains exactly kk positions and the last positions on the last page may be left empty.
Tokitsukaze would do the following operation: focus on the first special page that contains at least one special item, and at one time, Tokitsukaze would discard all special items on this page. After an item is discarded or moved, its old position would be empty, and then the item below it, if exists, would move up to this empty position. The movement may bring many items forward and even into previous pages, so Tokitsukaze would keep waiting until all the items stop moving, and then do the operation (i.e. check the special page and discard the special items) repeatedly until there is no item need to be discarded.
Consider the first example from the statement: n=10n=10 , m=4m=4 , k=5k=5 , p=[3,5,7,10]p=[3,5,7,10] . The are two pages. Initially, the first page is special (since it is the first page containing a special item). So Tokitsukaze discards the special items with indices 33 and 55 . After, the first page remains to be special. It contains [1,2,4,6,7][1,2,4,6,7] , Tokitsukaze discards the special item with index 77 . After, the second page is special (since it is the first page containing a special item). It contains [9,10][9,10] , Tokitsukaze discards the special item with index 1010 . Tokitsukaze wants to know the number of operations she would do in total.
The first line contains three integers nn , mm and kk (1≤n≤10181≤n≤1018 , 1≤m≤1051≤m≤105 , 1≤m,k≤n1≤m,k≤n ) — the number of items, the number of special items to be discarded and the number of positions in each page.
The second line contains mm distinct integers p1,p2,…,pmp1,p2,…,pm (1≤p1<p2<…<pm≤n1≤p1<p2<…<pm≤n ) — the indices of special items which should be discarded.
Print a single integer — the number of operations that Tokitsukaze would do in total.
10 4 5 3 5 7 10
3
13 4 5 7 8 9 10
1
For the first example:
For the second example, Tokitsukaze would focus on the second page [6,7,8,9,10][6,7,8,9,10] and discard all special items at once.
code
// #include<bits/stdc++.h> using namespace std; #define ll long long int main() { ll n,m; ll k; cin>>n>>m>>k; ll a; ll sum=0; ll ans=0; ll tot=0; ll stp=0; for(int i=1;i<=m;i++) { cin>>a; if(i==1) { ans=((a-sum-1)/(k)+1); tot++; } else { if(ans==((a-sum-1)/(k)+1)) { tot++; } else if(ans!=((a-sum-1)/(k)+1)) { sum+=tot; tot=1; ans=((a-sum-1)/(k)+1); stp++; } } } cout<<stp+1; }
标签：limit round ret order least inter graph XML OWIN
原文地址：https://www.cnblogs.com/OIEREDSION/p/11183092.html
